A Trust-Region SLCP Model Algorithm for Nonlinear Programming

DOI10.1007/978-3-642-60539-0_18MaRDI QIDQ4336104zbMATH OpenOpenAlexFDO

Authors J. M. Martínez

Publication date 12 June 1997

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-60539-0_18

zbMATH Keywords

global convergencenonsmooth merit functionprojected gradientssequential linearly constrained programmingtrust regions

Mathematics Subject Classification ID

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

Recommendations

• Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
• scientific article; zbMATH DE number 1210853
• A trust region method based on interior point techniques for nonlinear programming.
• Two-phase model algorithm with global convergence for nonlinear programming

Cited in

(2)

• Two-phase model algorithm with global convergence for nonlinear programming
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.

This page was built for publication: A Trust-Region SLCP Model Algorithm for Nonlinear Programming

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