Inexact-restoration algorithm for constrained optimization

DOI10.1023/A:1004632923654zbMath0969.90094OpenAlexW1534733421WikidataQ113098049 ScholiaQ113098049MaRDI QIDQ1973486

Elvio A. Pilotta, José Mario Martínez

Publication date: 4 October 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004632923654

zbMATH Keywords

rate of convergencepolynomial complexitynonlinear complementarity problemsinexact interior point

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate., Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications, Inexact restoration for derivative-free expensive function minimization and applications, An inexact-restoration method for nonlinear bilevel programming problems, On the best achievable quality of limit points of augmented Lagrangian schemes, Sequential equality-constrained optimization for nonlinear programming, An inexact restoration strategy for the globalization of the sSQP method, Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration, An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Local convergence of an inexact-restoration method and numerical experiments, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, Constrained derivative-free optimization on thin domains, 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, On the sensitivity of a Euclidean projection, Inexact restoration and adaptive mesh refinement for optimal control, Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework, Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, Inexact restoration with subsampled trust-region methods for finite-sum minimization, Non-monotone inexact restoration method for nonlinear programming, Inexact restoration method for minimization problems arising in electronic structure calculations, Bilevel optimization with a multiobjective problem in the lower level, The demand adjustment problem via inexact restoration method, On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications, A practical optimality condition without constraint qualifications for nonlinear programming, On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors, Inexact restoration for Euler discretization of box-constrained optimal control problems, On approximate KKT condition and its extension to continuous variational inequalities, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, New condition characterizing the solutions of variational inequality problems, Global convergence of a general filter algorithm based on an efficiency condition of the step, Global convergence of slanting filter methods for nonlinear programming, String-averaging incremental stochastic subgradient algorithms, Inexact restoration method for nonlinear optimization without derivatives, Euler discretization and inexact restoration for optimal control, An inexact restoration derivative-free filter method for nonlinear programming, Assessing the reliability of general-purpose inexact restoration methods, An interior-point method for solving box-constrained underdetermined nonlinear systems, Newton-type methods: a broader view, A new line search inexact restoration approach for nonlinear programming, A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations, Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems, Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming., Inexact Restoration approach for minimization with inexact evaluation of the objective function, Local convergence of filter methods for equality constrained non-linear programming, A filter algorithm: comparison with NLP solvers, On the Complexity of an Inexact Restoration Method for Constrained Optimization, On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming, Optimality conditions and global convergence for nonlinear semidefinite programming, On sequential optimality conditions for smooth constrained optimization, Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization, A filter inexact-restoration method for nonlinear programming, Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact, Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, A flexible inexact-restoration method for constrained optimization, On Optimality Conditions for Nonlinear Conic Programming, A stochastic first-order trust-region method with inexact restoration for finite-sum minimization, An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems

Uses Software

• LANCELOT
• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 trust region algorithm for equality constrained optimization
• Distributing many points on a sphere
• Two-phase model algorithm with global convergence for nonlinear programming
• Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
• A trust-region strategy for minimization on arbitrary domains
• 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
• A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Large-scale linearly constrained optimization
• On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
• A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• A trust region method based on interior point techniques for nonlinear programming.