Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208)

scientific article

Language	Label	Description	Also known as
English	Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization	scientific article

Statements

instance of

scholarly article

0 references

title

Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (English)

0 references

author

Yanyan Li

0 references

published in

Journal of Complexity

0 references

publication date

2 July 2019

0 references

full work available at URL

https://arxiv.org/abs/1705.07285

0 references

zbMATH Keywords

nonlinear optimization

0 references

constrained problems

0 references

high-order optimality conditions

0 references

complexity theory

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

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

0 references

Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization

0 references

Linearly Constrained Non-Lipschitz Optimization for Image Restoration

0 references

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

0 references

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

0 references

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

0 references

Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets

0 references

Optimality Conditions for Degenerate Extremum Problems with Equality Constraints

0 references

The \(p\)th-order optimality conditions for inequality constrained optimization problems

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

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

0 references

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

0 references

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization

0 references

On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods

0 references

Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization

0 references

Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization

0 references

Global convergence rate analysis of unconstrained optimization methods based on probabilistic models

0 references

Metric regularity, tangent sets, and second-order optimality conditions

0 references

Trust Region Methods

0 references

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

0 references

Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case

0 references

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

0 references

Accelerated gradient methods for nonconvex nonlinear and stochastic programming

0 references

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

0 references

Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality

0 references

Direct Search Based on Probabilistic Descent

0 references

Recursive Trust-Region Methods for Multiscale Nonlinear Optimization

0 references

Q3141900

0 references

Point-to-Set Maps in Mathematical Programming

0 references

On Nesterov's smooth Chebyshev–Rosenbrock function

0 references

An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems

0 references

A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization

0 references

On High-order Model Regularization for Constrained Optimization

0 references

Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization

0 references

Cubic regularization of Newton method and its global performance

0 references

Convex Analysis

0 references

Practical inexact proximal quasi-Newton method with global complexity analysis

0 references

Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization

0 references

On a global complexity bound of the Levenberg-marquardt method

0 references

Worst case complexity of direct search

0 references

Identifiers

zbMATH Open document ID

1415.90118

0 references

DOI

10.1016/j.jco.2018.11.001

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2001208