Complexity of a projected Newton-CG method for optimization with bounds

Large-scale problems in mathematical programming (90C06) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60) Newton-type methods (49M15)

Cites Work

Title not available (Why is that?)
Projected Gradient Methods for Nonnegative Matrix Factorization
Evaluating Derivatives
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
Projected Newton Methods for Optimization Problems with Simple Constraints
On the Solution of Large Quadratic Programming Problems with Bound Constraints
Efficient nonnegative matrix factorization via projected Newton method
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
Regularization, optimization, kernels, and support vector machines
Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
On regularization and active-set methods with complexity for constrained optimization
Nonlinear programming
Complexity and performance of an augmented Lagrangian algorithm
A trust region method for finding second-order stationarity in linearly constrained nonconvex optimization
On the complexity of an augmented Lagrangian method for nonconvex optimization
Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
Complexity analysis of a trust funnel algorithm for equality constrained optimization

This page was built for publication: Complexity of a projected Newton-CG method for optimization with bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608031)