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