A flexible inexact-restoration method for constrained optimization
From MaRDI portal
Publication:2346395
DOI10.1007/s10957-014-0572-0zbMath1322.90093OpenAlexW2056297600WikidataQ113106858 ScholiaQ113106858MaRDI QIDQ2346395
Luís Felipe Bueno, Gabriel Haeser, José Mario Martínez
Publication date: 1 June 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0572-0
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions (49K99)
Related Items
Sequential equality-constrained optimization for nonlinear programming, An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization, Nonmonotone inexact restoration approach for minimization with orthogonality constraints, Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, Non-monotone inexact restoration method for nonlinear programming, Assessing the reliability of general-purpose inexact restoration methods, On the Complexity of an Inexact Restoration Method for Constrained Optimization, Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization, On Optimality Conditions for Nonlinear Conic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inexact restoration method for minimization problems arising in electronic structure calculations
- 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
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
- A practical optimality condition without constraint qualifications for nonlinear programming
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Inexact-restoration algorithm for constrained optimization
- An inexact modified subgradient algorithm for nonconvex optimization
- A primal dual modified subgradient algorithm with sharp Lagrangian
- Euler discretization and inexact restoration for optimal control
- On the asymptotic behaviour of some new gradient methods
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- Inexact Restoration for Runge–Kutta Discretization of Optimal Control Problems
- Local convergence of filter methods for equality constrained non-linear programming
- On relaxed constant rank regularity condition in mathematical programming
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Lagrange Multipliers and Optimality
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
- Two-Point Step Size Gradient Methods
- Gradient Method with Retards and Generalizations
- Inexact spectral projected gradient methods on convex sets
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Globally Convergent Filter Method for Nonlinear Programming
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Two New Weak Constraint Qualifications and Applications
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- On sequential optimality conditions for smooth constrained optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
