Superlinear convergence of a trust region type successive linear programming method

DOI10.1007/BF00962802zbMath0644.90110MaRDI QIDQ1102881

Zhang, Jianzhong

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

nonsmooth optimizationbang-bang controlsuperlinear convergencegrowth conditiontrust regionsuccessive linear programmingcomposite nondifferentiable optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical methods based on nonlinear programming (49M37) Utility theory (91B16)

Related Items

A trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical treatment of a parabolic boundary-value control problem
• Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen
• Numerical solution of a time-optimal parabolic boundary-value control problem
• An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
• On the “bang-bang” control problem
• Convergence Rates of Quasi-Newton Algorithms for Some Nonsmooth Optimization Problems
• Optimization and nonsmooth analysis
• An Improved Successive Linear Programming Algorithm
• Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
• Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
• On optimality conditions in nondifferentiable programming