Inexact restoration for derivative-free expensive function minimization and applications
From MaRDI portal
Publication:2122038
DOI10.1016/j.cam.2022.114193zbMath1494.65038arXiv2009.09062OpenAlexW4221013049MaRDI QIDQ2122038
Ernesto G. Birgin, Nataša Krejić, José Mario Martínez
Publication date: 5 April 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.09062
algorithmsnonlinear programmingderivative-free methodinexact restorationinexact evaluation of expensive function
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20)
Related Items
Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, An adaptive high order method for finding third-order critical points of nonconvex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Inexact restoration method for nonlinear optimization without derivatives
- An inexact restoration derivative-free filter method for nonlinear programming
- 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
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
- Inexact restoration for Euler discretization of box-constrained optimal control problems
- Inexact-restoration algorithm for constrained optimization
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- Inexact restoration with subsampled trust-region methods for finite-sum minimization
- Non-monotone inexact restoration method for nonlinear programming
- A note on solving nonlinear optimization problems in variable precision
- The demand adjustment problem via inexact restoration method
- Assessing the reliability of general-purpose inexact restoration methods
- An inexact restoration strategy for the globalization of the sSQP method
- Euler discretization and inexact restoration for optimal control
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- Inexact Restoration approach for minimization with inexact evaluation of the objective function
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- Inexact Restoration for Runge–Kutta Discretization of Optimal Control Problems
- The Solution of Nonlinear Systems of Equations by Second Order Systems of O.D.E. and Linearly Implicit A-Stable Techniques
- Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
- Inexact spectral projected gradient methods on convex sets
- Trust Region Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors
- Inexact Objective Function Evaluations in a Trust-Region Algorithm for PDE-Constrained Optimization under Uncertainty
- On the Complexity of an Inexact Restoration Method for Constrained Optimization
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- Numerical Experience with a Class of Algorithms for Nonlinear Optimization Using Inexact Function and Gradient Information
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Algorithm 813
- Minimizing convex quadratics with variable precision conjugate gradients
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
