The linearization method

DOI10.1080/02331938708843231zbMath0679.90067OpenAlexW4238121933MaRDI QIDQ4729625

B. N. Pshenichnyĭ

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843231

zbMATH Keywords

linearizationconvergence ratesuperlinear convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

The multiproximal linearization method for convex composite problems ⋮ A representation of generalized convex polyhedra and applications ⋮ The linearization method: Principal concepts and perspective directions

Cites Work

• A globally convergent method for nonlinear programming
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Dual Variable Metric Algorithms for Constrained Optimization
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Algorithms for nonlinear constraints that use lagrangian functions
• A quadratically-convergent algorithm for general nonlinear programming problems

This page was built for publication: The linearization method