Sciweavers

393 search results - page 3 / 79
» Convex Programming Methods for Global Optimization
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
DAC
2004
ACM
14 years 8 months ago
Automated design of operational transconductance amplifiers using reversed geometric programming
We present a method for designing operational amplifiers using reversed geometric programming, which is an extension of geometric programming that allows both convex and non-conve...
Johan P. Vanderhaegen, Robert W. Brodersen
EOR
2007
105views more  EOR 2007»
13 years 7 months ago
Newton's method and its use in optimization
Newton’s method is a basic tool in numerical analysis and numerous applications, including operations research and data mining. We survey the history of the method, its main ide...
Boris T. Polyak
JOTA
2011
149views more  JOTA 2011»
13 years 2 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...

Book
518views
15 years 6 months ago
Convex Optimization
Book web site includes links to a full course, software, and other material.
Stephen Boyd, Lieven Vandenberghe