Nonlinear programming and nonsmooth optimization by successive linear programming

DOI10.1007/BF01582292zbMath0724.90062OpenAlexW2067824962MaRDI QIDQ2277149

Yanyan Li

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582292

zbMATH Keywords

global convergencenonsmooth optimizationsuperlinear convergenceColeman-Conn methodexact \(\ell _ 1\) penalty functiontrust region constraint

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems ⋮ An inexact first-order method for constrained nonlinear optimization ⋮ Corrected sequential linear programming for sparse minimax optimization ⋮ Unnamed Item ⋮ A proximal method for composite minimization ⋮ On the use of piecewise linear models in nonlinear programming ⋮ On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming ⋮ An augmented Lagrangian filter method ⋮ Steering exact penalty methods for nonlinear programming ⋮ An active set method for general linear problem subject to box constraints ⋮ Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs ⋮ The Sequential Quadratic Programming Method ⋮ Linear-programming approach to nonconvex variational problems ⋮ Trust-region interior-point method for large sparsel₁optimization ⋮ Dynamic evacuation routes for personnel on a naval ship ⋮ Point-Based Set-Valued Approximations, C -Differential Operators and Applications ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ A projected conjugate gradient method for sparse minimax problems ⋮ Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Cites Work

• Local properties of algorithms for minimizing nonsmooth composite functions
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• Nonlinear programming via an exact penalty function: Global analysis
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item