83 search results - page 3 / 17 » Warm-Start Strategies in Interior-Point Methods for Linear P... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
166
click to vote
MP
2011
14 years 10 days ago
2011
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
68
Voted
MP
2002
14 years 9 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
99
Voted
OL
2007
14 years 9 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
NIPS
2003
14 years 11 months ago
2003
— One way of image denoising is to project a noisy image to the subspace of admissible images derived, for instance by PCA. However, a major drawback of this method is that all p...