Successive linearization methods for large-scale nonlinear programming problems

DOI10.1007/BF03167197zbMath0773.90067OpenAlexW2089903473MaRDI QIDQ1185122

Toshihide Ibaraki, Shuichi Ohsaki, Keiichi Takazawa, Masao Fukushima

Publication date: 28 June 1992

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(L_ 1\)-exact penalty functionsuccessive linear method

Mathematics Subject Classification ID

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

Related Items

A parallel descent algorithm for convex programming, Sequential semidefinite program for maximum robustness design of structures under load uncertainty, Optimizing financial and physical assets with chance-constrained programming in the electrical industry, Successive linearization methods for nonlinear semidefinite programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• Test examples for nonlinear programming codes
• A globally convergent method for nonlinear programming
• A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
• Truncated-Newton algorithms for large-scale unconstrained optimization
• An Improved Successive Linear Programming Algorithm
• Successive Linear Programming at Exxon
• Exact penalty functions in nonlinear programming
• Nonlinear Optimization by Successive Linear Programming
• Non-Linear Programming Via Penalty Functions