scientific article; zbMATH DE number 1323073

MaRDI QIDQ4254975zbMATH OpenFDO

Authors Xiaoling Sun, Liansheng Zhang, Yanqin Bai

Publication date 24 May 2000

zbMATH Keywords

Armijo-type line searchglobal convergencenonsmooth optimizationsuccessive quadratic programming

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• A successive quadratic programming method for a class of nonsmooth optimization problems and its global convergence
• scientific article; zbMATH DE number 1053660
• scientific article; zbMATH DE number 1180444
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
• Local properties of inexact methods for minimizing nonsmooth composite functions

Cited in

(10)

• A successive quadratic programming method for a class of constrained nonsmooth optimization problems
• Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
• A successive quadratic programming method for a class of nonsmooth optimization problems and its global convergence
• Local properties of inexact methods for minimizing nonsmooth composite functions
• scientific article; zbMATH DE number 1329077 (Why is no real title available?)
• scientific article; zbMATH DE number 1053660 (Why is no real title available?)
• scientific article; zbMATH DE number 1180444 (Why is no real title available?)
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
• The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches
• An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254975)