Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.

DOI10.1007/s10107980014azbMath1050.90574OpenAlexW290656398MaRDI QIDQ1572667

José Mario Martínez, María Cristina Maciel, Francisco A. M. Gomes

Publication date: 21 July 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear programming successive quadratic programming trust regions augmented Lagrangians Lipschitz conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (17)

A globally convergent penalty-free method for optimization with equality constraints and simple bounds ⋮ A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization ⋮ Global convergence of a new nonmonotone filter method for equality constrained optimization ⋮ Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds ⋮ A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy ⋮ Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems ⋮ Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization ⋮ An algorithm for the topology optimization of geometrically nonlinear structures ⋮ Global convergence of slanting filter methods for nonlinear programming ⋮ Inexact-restoration algorithm for constrained optimization ⋮ A trust-region method by active-set strategy for general nonlinear optimization ⋮ A nonmonotone filter trust region method for nonlinear constrained optimization ⋮ A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization ⋮ Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. ⋮ A line search exact penalty method with bi-object strategy for nonlinear constrained optimization ⋮ Adaptive augmented Lagrangian methods: algorithms and practical numerical experience ⋮ Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization

Uses Software

LANCELOT

This page was built for publication: Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.