On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds

DOI10.1023/A:1008667728545MaRDI QIDQ1363060zbMATH OpenOpenAlexFDO

Authors O. Diekmann

Publication date 1997

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008667728545

zbMATH Keywords

barrier methodscomplexityinequality constraintsinner iterationsouter iteration

Mathematics Subject Classification ID

Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 556481
• Global convergence of a trust-region algorithm for inequality constrained optimization
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

Cited in

(5)

• Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems
• Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software
• scientific article; zbMATH DE number 556481 (Why is no real title available?)
• Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

Describes a project that uses

Uses Software

• LANCELOT

This page was built for publication: On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds

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