Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- 13 November 2022
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 17 (3) , 561-589
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Advanced Scientific Computing Research (DE-AC02-06CH11357)
This publication has 16 references indexed in Scilit:
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimizationOptimization Methods and Software, 2017
- CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimizationComputational Optimization and Applications, 2014
- Automatic View Synthesis by Image-Domain-WarpingIEEE Transactions on Image Processing, 2013
- Algorithm 909ACM Transactions on Mathematical Software, 2011
- Interior Point Methods for Nonlinear Optimization2010
- HOPSPACK 2.0 user manual.2009
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- Convex Optimization2004
- A Mathematical View of Interior-Point Methods in Convex Optimization2001
- Algorithm 778: L-BFGS-BACM Transactions on Mathematical Software, 1997