Non-monotone inexact restoration method for nonlinear programming
From MaRDI portal
Publication:2191795
DOI10.1007/s10589-019-00129-2zbMath1446.90148OpenAlexW2973171382WikidataQ113107256 ScholiaQ113107256MaRDI QIDQ2191795
Douglas S. Gonçalves, Juliano B. Francisco, Lila L. T. Paredes, Fermin S. Viloche Bazán
Publication date: 26 June 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00129-2
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Inexact restoration for derivative-free expensive function minimization and applications ⋮ Nonmonotone inexact restoration approach for minimization with orthogonality constraints ⋮ Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints ⋮ Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization ⋮ Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- Inexact restoration method for minimization problems arising in electronic structure calculations
- Inexact restoration method for nonlinear optimization without derivatives
- Solution of a truss topology bilevel programming problem by means of an inexact restoration method
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- 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
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- Inexact-restoration algorithm for constrained optimization
- Assessing the reliability of general-purpose inexact restoration methods
- A flexible inexact-restoration method for constrained optimization
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Inexact Restoration approach for minimization with inexact evaluation of the objective function
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- Inexact Restoration for Runge–Kutta Discretization of Optimal Control Problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- Numerical Optimization
- On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors
- A Globally Convergent Filter Method for Nonlinear Programming
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained 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.
- On the nonmonotone line search
This page was built for publication: Non-monotone inexact restoration method for nonlinear programming
