AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION
From MaRDI portal
Publication:2846484
DOI10.1142/S0217595913400058zbMath1273.65070MaRDI QIDQ2846484
Publication date: 5 September 2013
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Uses Software
Cites Work
- An affine-scaling interior-point CBB method for box-constrained optimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Numerical methods for large-scale nonlinear optimization
- A New Active Set Algorithm for Box Constrained Optimization
- On the Identification of Active Constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- CUTE
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Newton's Method for Large Bound-Constrained Optimization Problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- Exceptional family of elements for a generalized set-valued variational inequality in Banach spaces
- A Two-Term PRP-Based Descent Method
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Benchmarking optimization software with performance profiles.
This page was built for publication: AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION
