Generating box-constrained optimization problems

DOI10.1145/275323.275331zbMath0903.65056OpenAlexW2057088361WikidataQ113310242 ScholiaQ113310242MaRDI QIDQ3840044

Francisco Facchinei, João Oliveira Soares, Joaquim Joao Júdice

Publication date: 10 August 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/10703

zbMATH Keywords

optimizationnonlinear programming test problemstest problems generation

Mathematics Subject Classification ID

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

Related Items (7)

Study of multiscale global optimization based on parameter space partition ⋮ An active set strategy based on the multiplier function or the gradient. ⋮ Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds ⋮ Steplength selection in gradient projection methods for box-constrained quadratic programs ⋮ An accurate active set Newton algorithm for large scale bound constrained optimization. ⋮ On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches ⋮ Hybrid limited memory gradient projection methods for box-constrained optimization problems

Uses Software

• Algorithm 774

This page was built for publication: Generating box-constrained optimization problems