New algorithms for maximization of concave functions with box constraints

DOI10.1051/RO/1992260302091MaRDI QIDQ4021561zbMATH OpenOpenAlexFDO

Authors A. Friedlander, J. M. Martínez

Publication date 16 January 1993

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

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

zbMATH Keywords

active set strategiesbox constraintsdifferentiable concave functiongradient projection method

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30)

Recommendations

• An algorithm for solving convex programs subject to box constraints
• On the Maximization of a Concave Quadratic Function with Box Constraints
• A new algorithm for box-constrained global optimization
• On box constrained concave quadratic optimization
• A new algorithm for the general quadratic programming problems with box constraints
• A convergent decomposition method for box-constrained optimization problems
• A new bounding algorithm for solving Lipschitz optimization problem with box constraints
• Solutions and optimality criteria to box constrained nonconvex minimization problems
• A New Active Set Algorithm for Box Constrained Optimization
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation

Cited in

(3)

• A note on maximizing a special concave function subject to simultaneous Loewner order constraints
• On the Maximization of a Concave Quadratic Function with Box Constraints
• On the numerical solution of bound constrained optimization problems

This page was built for publication: New algorithms for maximization of concave functions with box constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021561)