On polyhedral approximations of the second-order cone

Mathematics of Operations Research

Volumn 26, Issue 2, 2001, Pages 193-205

  Ben Tal, A ^a   Nemirovski, A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Linear programming; Polynomial time reducibility; Second order cone programming

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONIC QUADRATIC PROBLEMS (CQP);

QUADRATIC PROGRAMMING;

EID: 0035351629     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.2.193.10561     Document Type: Article

References (9)

1. Potential reduction polynomial time method for Truss topology design
2. Robust convex optimization
3. Frictional contact algorithms based on semismooth Newton methods
4. Applications of second-order cone programming
5. Interior-point polynomial algorithms in convex programming
6. Self-scaled barriers and interior-point met hods for convex programming
7. Primal-dual interior-point methods for self-scaled cones
8. A unified approach to frictional contact problems