Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
From MaRDI portal
Publication:2301133
DOI10.1007/s10589-019-00138-1zbMath1432.90119OpenAlexW2980519588WikidataQ127018013 ScholiaQ127018013MaRDI QIDQ2301133
Carmo P. Brás, Marcos Raydan, José Mario Martínez
Publication date: 28 February 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10362/97712
Lanczos methodNewton-type methodssubspace minimizationcubic modelingsmooth unconstrained minimizationtrust-region strategiesdisk packing problem
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- 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
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- On the truncated conjugate gradient method
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- A polyhedral branch-and-cut approach to global optimization
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Cubic regularization of Newton method and its global performance
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
- Matrix Algorithms
- A New Upper Bound for the Cylinder Packing Problem
- Numerical Methods for Large Eigenvalue Problems
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Newton-Type Minimization via the Lanczos Method
- Computing a Trust Region Step
- On Using Approximate Finite Differences in Matrix-Free Newton–Krylov Methods
- Trust Region Methods
- Solving the Trust-Region Subproblem using the Lanczos Method
- A Limited Memory Algorithm for Bound Constrained Optimization
- Cylinder packing by simulated annealing
