Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Trust region algorithms for optimization with nonlinear equality and inequality constraints
Trust region algorithms for optimization with nonlinear equality and inequality constraints
Inexact-restoration algorithm for constrained optimization
Journal of Optimization Theory and Applications
Computational Optimization and Applications
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
SIAM Journal on Optimization
A Globally Convergent Filter Method for Nonlinear Programming
SIAM Journal on Optimization
Hi-index | 0.00 |
Inexact Restoration methods have been introduced for solving nonlinear programming problems. Each iteration is composed of two phases. The first one reduces a measure of infeasibility, while in the second one the objective function value is reduced in a tangential approximation of the feasible set. The point obtained from the second phase is compared with the current point either by means of a merit function or by using a filter criterion. A comparative numerical study about these criteria by using a family of Hard-Spheres Problems is presented.