On the complexity of solving feasibility problems with regularized models
From MaRDI portal
Recommendations
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- On High-order Model Regularization for Constrained Optimization
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- On the complexity of finding first-order critical points in constrained nonlinear optimization
Cites work
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- Accelerated regularized Newton methods for minimizing composite convex functions
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Complexity and performance of an augmented Lagrangian algorithm
- Cubic regularization of Newton method and its global performance
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Douglas-Rachford feasibility methods for matrix completion problems
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On High-order Model Regularization for Constrained Optimization
- On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- Practical augmented Lagrangian methods for constrained optimization
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Cited in
(3)
This page was built for publication: On the complexity of solving feasibility problems with regularized models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038424)
