A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results

Author： Auslender Alfred  

Publisher： Elsevier

ISSN： 0025-5610

Source： Mathematical Programming, Vol.142, Iss.1-2, 2013-12, pp. : 349-369

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

An Inexact SQP Newton Method for Convex SC1 Minimization Problems

By Chen Y.   Gao Y.   Liu Y.-J.  

Journal of Optimization Theory and Applications, Vol. 146, Iss. 1, 2010-07 ,pp. : 33-49

Springer Publishing Company

Access to resources Recommend Favorite

Solving quadratically constrained convex optimization problems with an interior-point method

By Mészáros Csaba  

Optimization Methods and Software, Vol. 26, Iss. 3, 2011-06 ,pp. : 421-429

Taylor & Francis Ltd

Access to resources Recommend Favorite

A sequential method for a class of box constrained quadratic programming problems

By Cambini Riccardo  

Mathematical Methods of Operations Research, Vol. 67, Iss. 2, 2008-04 ,pp. : 223-243

Springer Publishing Company

Access to resources Recommend Favorite

General iterative methods for equilibrium and constrained convex minimization problem

By Tian Ming   Liu Lei  

Optimization, Vol. 63, Iss. 9, 2014-09 ,pp. : 1367-1385

Taylor & Francis Ltd

Access to resources Recommend Favorite

Forward–Backward Penalty Scheme for Constrained Convex Minimization Without Inf-Compactness

By Noun Nahla   Peypouquet Juan  

Journal of Optimization Theory and Applications, Vol. 158, Iss. 3, 2013-09 ,pp. : 787-795

Springer Publishing Company

Access to resources Recommend Favorite