MP 2011 - PDF Preprint Papers

MP 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MP-2011 Paper

click to vote

MP
2011

250views Intelligent Agents» more MP 2011»

An interior-point piecewise linear penalty method for nonlinear programming

12 years 7 months ago

Download www.corc.ieor.columbia.edu

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...

Lifeng Chen, Donald Goldfarb

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	250	An interior-point piecewise linear penalty method for nonlinear programming	claim
2	244	Fixed point and Bregman iterative methods for matrix rank minimization	claim
3	237	Lifting for conic mixed-integer programming	claim
4	234	Statistical ranking and combinatorial Hodge theory	claim
5	228	Necessary global optimality conditions for nonlinear programming problems with polynomial constraints	claim
6	218	Strong KKT conditions and weak sharp solutions in convex-composite optimization	claim
7	216	An FPTAS for minimizing the product of two non-negative linear cost functions	claim
8	206	Smoothed analysis of condition numbers and complexity implications for linear programming	claim
9	202	A first-order interior-point method for linearly constrained smooth optimization	claim
10	198	On the relative strength of split, triangle and quadrilateral cuts	claim
11	191	Null space conditions and thresholds for rank minimization	claim
12	190	Implicit solution function of P0 and Z matrix linear complementarity constraints	claim
13	189	On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers	claim
14	186	A warm-start approach for large-scale stochastic linear programs	claim
15	185	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers