Sciweavers

36 search results - page 2 / 8
» Second-order global optimality conditions for convex composi...
Sort
View
EOR
2007
113views more  EOR 2007»
13 years 4 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
VLSID
1999
IEEE
111views VLSI» more  VLSID 1999»
13 years 9 months ago
A New Approach for CMOS Op-Amp Synthesis
A new approach for CMOS op-amp circuit synthesis has proposed here. The approach is based on the observation that the rst order behavior of a MOS transistor in the saturation regi...
Pradip Mandal, V. Visvanathan
JMLR
2010
143views more  JMLR 2010»
13 years 3 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
JMIV
2010
115views more  JMIV 2010»
12 years 11 months ago
Generalized Convexity in Multiple View Geometry
Recent work on geometric vision problems has exploited convexity properties in order to obtain globally optimal solutions. In this paper we give an overview of these developments a...
Carl Olsson, Fredrik Kahl
MOR
2006
81views more  MOR 2006»
13 years 4 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala