Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method
Year of publication: |
2017
|
---|---|
Authors: | Huang, Kuo-Ling ; Mehrotra, Sanjay |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 29.2017, 1, p. 36-53
|
Subject: | quadratic programs | quadratically constrained quadratic programs | convex programs | homogeneous algorithms | interior point methods | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Conic optimization with spectral functions on Euclidean Jordan algebras
Coey, Chris, (2023)
-
Worst-case iteration bounds for log barrier methods on problems with nonconvex constraints
Hinder, Oliver, (2024)
-
Solving the continuous nonlinear resource allocation problem with an interior point method
Wright, Stephen E., (2014)
- More ...
-
An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
Huang, Kuo-Ling, (2015)
-
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
Huang, Kuo-Ling, (2013)
-
Minimizing total tardiness on a single machine with controllable processing times
Tseng, Chao-tang, (2009)
- More ...