On the numerical solution of bound constrained optimization problems

DOI10.1051/ro/1989230403191zbMath0683.90073OpenAlexW2289817039MaRDI QIDQ4733676

Ana Friedlander, José Mario Martínez

Publication date: 1989

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104967

zbMATH Keywords

global convergenceactive set strategiesdifferentiable concave function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (7)

A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions ⋮ On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ Nonmonotone strategy for minimization of quadratics with simple constraints. ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables

This page was built for publication: On the numerical solution of bound constrained optimization problems