Sciweavers

161 search results - page 2 / 33
» Methods for convex and general quadratic programming
Sort
View
MP
2008
81views more  MP 2008»
13 years 4 months ago
An inexact primal-dual path following algorithm for convex quadratic SDP
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
Kim-Chuan Toh
APPML
2007
91views more  APPML 2007»
13 years 5 months ago
Steplength selection in interior-point methods for quadratic programming
We present a new strategy for choosing primal and dual steplengths in a primal-dual interior-point algorithm for convex quadratic programming. Current implementations often scale ...
Frank E. Curtis, Jorge Nocedal

Book
518views
15 years 3 months ago
Convex Optimization
Book web site includes links to a full course, software, and other material.
Stephen Boyd, Lieven Vandenberghe
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
13 years 4 months ago
On the facet-to-facet property of solutions to convex parametric quadratic programs
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...
Jørgen Spjøtvold, Eric C. Kerrigan, ...
ICPR
2008
IEEE
14 years 6 months ago
Image segmentation by convex quadratic programming
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
Mariano Rivera, Oscar Dalmau Cedeño, Josue ...