An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
From MaRDI portal
Publication:4649640
Recommendations
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
- A flexible framework for cubic regularization algorithms for nonconvex optimization in function space
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
Cited in
(45)- Complexity analysis of a trust funnel algorithm for equality constrained optimization
- Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
- Model-based derivative-free methods for convex-constrained optimization
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Adaptive Third-Order Methods for Composite Convex Optimization
- A note on inexact gradient and Hessian conditions for cubic regularized Newton's method
- Complexity of a projected Newton-CG method for optimization with bounds
- On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
- An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints
- Algebraic rules for quadratic regularization of Newton's method
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- On global minimizers of quadratic functions with cubic regularization
- Subdivision-based nonlinear multiscale cloth simulation
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- On regularization and active-set methods with complexity for constrained optimization
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- Recent advances in trust region algorithms
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Hessian barrier algorithms for non-convex conic optimization
- Complexity bounds for second-order optimality in unconstrained optimization
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- A trust region method for finding second-order stationarity in linearly constrained nonconvex optimization
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
This page was built for publication: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649640)
