Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
From MaRDI portal
Publication:2301133
Recommendations
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- The substitution secant/finite difference method for large scale sparse unconstrained optimization
- A trust region subspace method for large-scale unconstrained optimization
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization
- On large-scale unconstrained optimization and arbitrary regularization
- scientific article; zbMATH DE number 1069181
Cites work
- A Limited Memory Algorithm for Bound Constrained Optimization
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- A new matrix-free algorithm for the large-scale trust-region subproblem
- A new upper bound for the cylinder packing problem
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- A polyhedral branch-and-cut approach to global optimization
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- 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
- Annealing, Cylinder Packing By Simulated
- Computing a Trust Region Step
- Cubic regularization of Newton method and its global performance
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1914189 (Why is no real title available?)
- Matrix algorithms. Vol. 2: Eigensystems
- Newton-Type Minimization via the Lanczos Method
- Numerical methods for large eigenvalue problems
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On the truncated conjugate gradient method
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- On Using Approximate Finite Differences in Matrix-Free Newton–Krylov Methods
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- Solving the Trust-Region Subproblem using the Lanczos Method
- Trust Region Methods
Cited in
(4)- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- The substitution secant/finite difference method for large scale sparse unconstrained optimization
- Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
This page was built for publication: Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301133)
