An algorithm for solving convex programs subject to box constraints
From MaRDI portal
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)
