An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
From MaRDI portal
Publication:4649640
DOI10.1093/imanum/drr035zbMath1267.65061OpenAlexW2133068139MaRDI QIDQ4649640
No author found.
Publication date: 12 November 2012
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/56166
global convergenceworst-case complexityconvex constraintsnonlinear unconstrained optimizationcubic regularization algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)
Related Items (38)
Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy ⋮ Model-Based Derivative-Free Methods for Convex-Constrained Optimization ⋮ Direct search based on probabilistic feasible descent for bound and linearly constrained problems ⋮ Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search ⋮ A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization ⋮ Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization ⋮ Finding second-order stationary points in constrained minimization: a feasible direction approach ⋮ Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization ⋮ Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares ⋮ A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization ⋮ A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization ⋮ Interior-point methods for nonconvex nonlinear programming: cubic regularization ⋮ Complexity bounds for second-order optimality in unconstrained optimization ⋮ On the complexity of finding first-order critical points in constrained nonlinear optimization ⋮ Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization ⋮ Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization ⋮ Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models ⋮ Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization ⋮ High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms ⋮ Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization ⋮ Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models ⋮ Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization ⋮ On the use of iterative methods in cubic regularization for unconstrained optimization ⋮ A note on inexact gradient and Hessian conditions for cubic regularized Newton's method ⋮ Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints ⋮ Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives ⋮ Subdivision-Based Nonlinear Multiscale Cloth Simulation ⋮ Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization ⋮ On global minimizers of quadratic functions with cubic regularization ⋮ Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization ⋮ On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods ⋮ Algebraic rules for quadratic regularization of Newton's method ⋮ Recent advances in trust region algorithms ⋮ An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints
This page was built for publication: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
