An Improved Successive Linear Programming Algorithm

DOI10.1287/MNSC.31.10.1312MaRDI QIDQ3737248zbMATH OpenOpenAlexFDO

Authors Jianzhong Zhang, N. H. Kim, Leon Lasdon

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

linearizationtrust regioncomputational resultsConvergence resultscontinuous first partial derivativeslinearly constrained penalty problemrestricted step

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• On the Convergence of Successive Linear-Quadratic Programming Algorithms
• Successive linearization methods for large-scale nonlinear programming problems
• Nonlinear programming and nonsmooth optimization by successive linear programming
• Exact penalty function for nonlinear programming problems
• scientific article; zbMATH DE number 3874966

Cited in

(37)

• A new model and algorithm design of pooling problem
• A continuous trust-region-type method for solving nonlinear semidefinite complementarity problem
• Improved sequential linear programming formulation for structural weight minimization
• Conservative scales in packing problems
• Successive Linear Programming at Exxon
• An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
• A trust region algorithm for minimization of locally Lipschitzian functions
• Successive linearization methods for large-scale nonlinear programming problems
• An improved targeted climbing algorithm for linear programs
• A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
• Trade-off preservation in inverse multi-objective convex optimization
• A fast gradient and function sampling method for finite-max functions
• Superlinear convergence of a trust region type successive linear programming method
• A unified approach to global convergence of trust region methods for nonsmooth optimization
• Unit-operation nonlinear modeling for planning and scheduling applications
• Linear-programming approach to nonconvex variational problems
• A strictly improving linear programming Phase I algorithm
• On the Convergence of Successive Linear-Quadratic Programming Algorithms
• A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks
• scientific article; zbMATH DE number 5031884 (Why is no real title available?)
• A linear programming-based optimization algorithm for solving nonlinear programming problems
• A novel non-linear approach to minimal area rectangular packing
• An improved general Phase-I method in linear programming
• Complexity analysis and algorithm design of pooling problem
• Negotiation-based collaborative planning between supply chains partners
• Corrected sequential linear programming for sparse minimax optimization
• Experiments with successive quadratic programming algorithms
• A cost minimization heuristic for the pooling problem
• Description of a Program for Nonlinear Programming: the Centroid Program
• Successive linearization methods for nonlinear semidefinite programs
• Strong formulations for the pooling problem
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• New multi-commodity flow formulations for the pooling problem
• Successive linear programming for ratio goal problems
• A simple SLP algorithm for solving a class of nonlinear programs
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
• A filter-type method for solving nonlinear semidefinite programming

This page was built for publication: An Improved Successive Linear Programming Algorithm

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