LMBOPT: a limited memory method for bound-constrained optimization
From MaRDI portal
Publication:2146448
DOI10.1007/s12532-021-00213-xzbMath1489.90185OpenAlexW4205429985MaRDI QIDQ2146448
Morteza Kimiaei, Arnold Neumaier, Behzad Azmi
Publication date: 16 June 2022
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-021-00213-x
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
LMBOPT, An active set trust-region method for bound-constrained optimization, A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations, An optimal subgradient algorithm for large-scale bound-constrained convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the application of an augmented Lagrangian algorithm to some portfolio problems
- Solving the minimal least squares problem subject to bounds on the variables
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- Dual techniques for constrained optimization
- Algorithms for bound constrained quadratic programming problems
- A class of methods for solving large, convex quadratic programs subject to box constraints
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- Analysis and implementation of a dual algorithm for constrained optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- MINQ8: general definite and bound constrained indefinite quadratic programming
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- On the convergence of projected gradient processes to singular critical points
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A two-stage active-set algorithm for bound-constrained optimization
- BOX-QUACAN and the implementation of augmented Lagrangian algorithms for minimization with inequality constraints
- On efficiently combining limited-memory and trust-region techniques
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- An effective algorithm for minimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A New Active Set Algorithm for Box Constrained Optimization
- Algorithm 851
- Projected gradient methods for linearly constrained problems
- Two-Point Step Size Gradient Methods
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Function minimization by conjugate gradients
- Algorithm 813
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Minimization algorithms based on supervisor and searcher cooperation
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
- MINQ8
- BOX-QUACAN
