An Improved Successive Linear Programming Algorithm

DOI10.1287/mnsc.31.10.1312zbMath0601.90128MaRDI QIDQ3737248

Zhang, Jianzhong, L. S. Lasdon, Nae-Heon Kim

Publication date: 1985

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.31.10.1312

zbMATH Keywords

linearization; computational results; trust region; Convergence results; continuous first partial derivatives; linearly constrained penalty problem; restricted step

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C05: Linear programming

49M37: Numerical methods based on nonlinear programming

Related Items

A novel non-linear approach to minimal area rectangular packing, Linear-programming approach to nonconvex variational problems, Negotiation-based collaborative planning between supply chains partners, Successive linearization methods for nonlinear semidefinite programs, Experiments with successive quadratic programming algorithms, Superlinear convergence of a trust region type successive linear programming method, Successive linearization methods for large-scale nonlinear programming problems, A simple SLP algorithm for solving a class of nonlinear programs, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), A trust region algorithm for minimization of locally Lipschitzian functions, Corrected sequential linear programming for sparse minimax optimization, A unified approach to global convergence of trust region methods for nonsmooth optimization