On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514)

scientific article; zbMATH DE number 7154034

Language	Label	Description	Also known as
English	On the Complexity of an Inexact Restoration Method for Constrained Optimization	scientific article; zbMATH DE number 7154034

Statements

instance of

scholarly article

0 references

title

On the Complexity of an Inexact Restoration Method for Constrained Optimization (English)

0 references

zbMATH Open document ID

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

21 January 2020

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

complexity

0 references

continuous optimization

0 references

constrained optimization

0 references

first-order methods

0 references

inexact restoration methods

0 references

regularization

0 references

0 references

0 references

MaRDI publication profile

0 references

Wikidata QID

Q126413316

0 references

cites work

An inexact-restoration method for nonlinear bilevel programming problems

0 references

On sequential optimality conditions for smooth constrained optimization

0 references

A Cone-Continuity Constraint Qualification and Algorithmic Consequences

0 references

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization

0 references

Bilevel optimization with a multiobjective problem in the lower level

0 references

Inexact restoration for Euler discretization of box-constrained optimal control problems

0 references

A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis

0 references

On the use of the energy norm in trust-region and adaptive cubic regularization subproblems

0 references

Assessing the reliability of general-purpose inexact restoration methods

0 references

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models

0 references

On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors

0 references

Constrained optimization with integer and continuous variables using inexact restoration and projected gradients

0 references

Local convergence of an inexact-restoration method and numerical experiments

0 references

The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization

0 references

On Regularization and Active-set Methods with Complexity for Constrained Optimization

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints

0 references

A flexible inexact-restoration method for constrained optimization

0 references

An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization

0 references

Towards an efficient augmented Lagrangian method for convex quadratic programming

0 references

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming

0 references

Complexity bounds for second-order optimality in unconstrained optimization

0 references

On the complexity of finding first-order critical points in constrained nonlinear optimization

0 references

Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

Optimal quadratic programming algorithms. With applications to variational inequalities

0 references

Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming

0 references

A new line search inexact restoration approach for nonlinear programming

0 references

Augmented Lagrangians, box constrained QP and extensions

0 references

Inexact restoration method for minimization problems arising in electronic structure calculations

0 references

Q4739659

0 references

Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints

0 references

A Globally Convergent Filter Method for Nonlinear Programming

0 references

On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization

0 references

Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems

0 references

Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.

0 references

On High-order Model Regularization for Constrained Optimization

0 references

Inexact-restoration algorithm for constrained optimization

0 references

A practical optimality condition without constraint qualifications for nonlinear programming

0 references

Cubic regularization of Newton method and its global performance

0 references

Numerical Optimization

0 references

full work available at URL

https://doi.org/10.1137/18m1216146

0 references

OpenAlex ID

W2997657492

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5210514