Exploiting cone approximations in an augmented Lagrangian method for conic optimization

DOI10.1080/10556788.2025.2576224MaRDI QIDQ6850176zbMATH OpenFDO

Authors Mituhiro Fukuda, Walter Gómez Bofill, Gabriel Haeser, Leonardo Makoto Mito

Publication date 3 March 2026

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A new sequential optimality condition for constrained optimization and algorithmic consequences
• A practical optimality condition without constraint qualifications for nonlinear programming
• A sequential convex semidefinite programming algorithm with an application to multiple-load free material optimization
• An adaptive linear approximation algorithm for copositive programs
• An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
• Copositive and completely positive matrices
• Hyperbolicity cones are amenable
• On optimality conditions for nonlinear conic programming
• On sequential optimality conditions for smooth constrained optimization
• On the accuracy of uniform polyhedral approximations of the copositive cone
• Open problems in the theory of completely positive and copositive matrices
• Optimality conditions and global convergence for nonlinear semidefinite programming
• Testing Unconstrained Optimization Software

This page was built for publication: Exploiting cone approximations in an augmented Lagrangian method for conic optimization

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