Primal-dual interior-point methods for domain-driven formulations
Year of publication: |
2020
|
---|---|
Authors: | Karimi, Mehdi ; Tunçel, Levent |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 45.2020, 2, p. 591-621
|
Subject: | convex optimization | interior-point methods | primal-dual algorithms | duality theory | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Constructing new weighted l1-algorithms for the sparsest points of polyhedral sets
Zhao, Yun-Bin, (2017)
-
An inexact primal-dual algorithm for semi-infinite programming
Wei, Bo, (2020)
-
Primal-dual algorithms for order fulfillment at Urban Outfitters, Inc.
Andrews, John M., (2019)
- More ...
-
Primal-dual entropy-based interior-point algorithms for linear optimization
Karimi, Mehdi, (2017)
-
Studying liquidity premium pricing, size, value and risk of market in Tehran stock exchange
Asl, Hassan Ghalibaf, (2012)
-
VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
KONG, LINGCHEN, (2009)
- More ...