An algorithm for solving convex programs subject to box constraints

MaRDI QIDQ2762845zbMATH OpenFDO

Authors Elena Popescu, I. M. Stancu-Minasian

Publication date 13 January 2002

Published in Analele Universității București. Matematică (Search for Journal in Brave)

zbMATH Keywords

box constraintsconvex programmingiterative methods

Mathematics Subject Classification ID

Convex programming (90C25)

Review text

There is proposed a method for solving convex programs with linear constraints and bounds on the variables. The algorithm finishes in a finite number of iterations.

Cited in

(8)

• An efficient algorithm for solving semi-infinite inequality problems with box constraints
• A general solution to least squares problems with box constraints and its applications
• An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
• On a box-constrained linear symmetric cone optimization problem
• Generating box-constrained optimization problems
• New algorithms for maximization of concave functions with box constraints
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
• On box-constrained total least squares problem

This page was built for publication: An algorithm for solving convex programs subject to box constraints

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