Improving the global convergence of inexact restoration methods for constrained optimization problems
From MaRDI portal
Publication:6622757
DOI10.1137/22M1493811MaRDI QIDQ6622757
R. Andreani, Alberto Ramos, L. D. Secchin
Publication date: 22 October 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Inexact restoration method for minimization problems arising in electronic structure calculations
- Stabilized SQP revisited
- Inexact restoration method for nonlinear optimization without derivatives
- A relaxed constant positive linear dependence constraint qualification and applications
- An inexact-restoration method for nonlinear bilevel programming problems
- Local convergence of an inexact-restoration method and numerical experiments
- A new line search inexact restoration approach for nonlinear programming
- New adaptive stepsize selections in gradient methods
- A practical optimality condition without constraint qualifications for nonlinear programming
- Inexact-restoration algorithm for constrained optimization
- On the best achievable quality of limit points of augmented Lagrangian schemes
- Non-monotone inexact restoration method for nonlinear programming
- Assessing the reliability of general-purpose inexact restoration methods
- A flexible inexact-restoration method for constrained optimization
- Bilevel optimization with a multiobjective problem in the lower level
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Julia: A Fresh Approach to Numerical Computing
- Inexact Restoration for Runge–Kutta Discretization of Optimal Control Problems
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- Variational Analysis
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Globally Convergent Filter Method for Nonlinear Programming
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization
- On the convergence of augmented Lagrangian strategies for nonlinear programming
- On the Complexity of an Inexact Restoration Method for Constrained Optimization
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact
- Practical Augmented Lagrangian Methods for Constrained Optimization
- On sequential optimality conditions for smooth constrained optimization
- Benchmarking optimization software with performance profiles.
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
This page was built for publication: Improving the global convergence of inexact restoration methods for constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622757)