An active set trust-region method for bound-constrained optimization
From MaRDI portal
Publication:2169274
DOI10.1007/s41980-021-00610-xzbMath1493.90188OpenAlexW3186505040MaRDI QIDQ2169274
Publication date: 2 September 2022
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-021-00610-x
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A limited memory quasi-Newton trust-region method for box constrained optimization
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- Representations of quasi-Newton matrices and their use in limited memory methods
- Introductory lectures on convex optimization. A basic course.
- Concise complexity analyses for trust region methods
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- LMBOPT: a limited memory method for bound-constrained optimization
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
- Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A two-stage active-set algorithm for bound-constrained optimization
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- On efficiently combining limited-memory and trust-region techniques
- Cubic regularization of Newton method and its global performance
- An effective algorithm for minimization
- Algorithm 851
- Numerical Optimization
- Trust Region Methods
- A Limited Memory Algorithm for Bound Constrained Optimization
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- The Limited Memory Conjugate Gradient Method
- Algorithm 813
- Convergence Conditions for Ascent Methods
