Two-Step Algorithms for Nonlinear Optimization with Structured Applications

DOI10.1137/S1052623498334396MaRDI QIDQ4702316zbMATH OpenOpenAlexFDO

Authors Andrew R. Conn, Chandu Visweswariah, L. N. Vicente

Publication date 24 November 1999

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623498334396

zbMATH Keywords

circuit optimizationexpensive function evaluationsLANCELOTline searchesminimax problemsslack variablesspacer stepstrust regionstwo-step algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
• scientific article; zbMATH DE number 645872
• A trust region method based on interior point techniques for nonlinear programming.
• Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.

Cited in

(5)

• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
• Derivative-free robust optimization for circuit design
• A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
• Boundedness and regularity properties of semismooth reformulations of variational inequalities
• scientific article; zbMATH DE number 6760917 (Why is no real title available?)

Describes a project that uses

Uses Software

• LANCELOT
• CUTEr
• GQTPAR
• JiffyTune

This page was built for publication: Two-Step Algorithms for Nonlinear Optimization with Structured Applications

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