Cutting plane algorithms for robust conic convex optimization problems

Optimization Methods and Software

Volumn 21, Issue 5, 2006, Pages 779-803

  Gomez, J A ^a   Gomez, W ^b  

^a UNIVERSIDAD DE LA FRONTERA   (Chile)

^b UNIVERSITY OF CONCEPCIÓN   (Chile)

Author keywords

Conic programming; Cutting plane algorithms; Semi infinite linear programming

Indexed keywords

CONVEX OPTIMIZATION; NONLINEAR PROGRAMMING;

CONIC PROGRAMMING; CONVEX OPTIMIZATION PROBLEMS; CUTTING PLANE ALGORITHMS; DISCRETIZATION ALGORITHMS; NONLINEAR PROBLEMS; NONLINEAR PROGRAMMING PROBLEM; SECOND-ORDER CONE PROGRAMMING; SEMI-DEFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 33846703932     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780500159128     Document Type: Article

References (28)

1. Amaya, J. and Gómez, J.A., 2005, Duality for inexact semi-infinite linear programming. Optimization, 54(1), 1-25.
2. Goberna, M.A. and López, M.A., 1998, Linear Semi-infinite Optimization (New York: John Wiley and Sons).
3. Hettich, R., 1986, An implementation of a discretization method for semi-infinite programming. Mathematical Programming, 34, 354-361.
4. Hettich, R. and Kortanek, K.O., 1993, Semi-infinite programming theory, methods and applications. SIAM Review, 35, 380-429.
5. Reemtsen, R., 1991, Discretization methods for the solution of semi-infinite programming problems. Journal of Optimization Theory and Application, 71(1), 85-103.
6. Reemtsen, R. and Görner, S., 1998, Numerical methods for semi-infinite programming: a survey. In: R. Reemtsen et al. (Eds) Semi-Infinite Programming, September 1996 (Boston: Kluwer Academic Publishers); Nonconvex Optimization and its Applications, 25, 195-275 (Workshop, Cottbus, Germany).
7. Tichatschke, R., Hettich, R. and Still, G., 1989, Connections between generalized, inexact and semi-infinite linear programming, ZOR- Methods and Models of Operations Research, 33, 367-382.
8. Vandenberghe, L. and Boyd, S., 1998, Connections between semi-infinite and semidefinite programming. In: R. Reemtsen et al. (Eds) Semi-Infinite Programming, September 1996 (Boston: Kluwer Academic Publishers). Nonconvex Optimization and its Applications, 25, 277-294 Workshop, Cottbus, Germany.
9. Amaya, J. and de Ghellinck, G., 1997, Duality for inexact linear programming problems. Optimization 39, 137-150.
10. Amaya, J. and Gómez, J.A., 2001, Strong duality for inexact linear programming problems. Optimization, 49(3), 243-269.
11. Matloka, M., 1992, Some generalization of inexact linear programming. Optimization 23, 1-6.
12. Soyster, A.L., 1973, Convex Programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21, 1154-1157.
13. Soyster, A.L., 1974, A duality theory for convex programming with set-inclusive constraints. Operations Research, 22, 892-898.
14. Alizadeh, F. and Goldfarb, D., 2003, Second-order cone programming. Mathematical Programming, 92, 3-51.
15. Ben Tal, A. and Nemirovski, A., 2001, Lectures on Modern Convex Optimization: Analysis, Algorithms, Engineering Applications- MPS-SIAM Series on Optimization, SIAM Philadelphia.
16. Goldfarb, D., 2002, The simplex method for conic programming, Technical Report, CORC Report 2002-05, Columbia University.
17. Krishnan, K. and Mitchell, J.E., 2001, A linear programming approach to semidefinite programming problems. Technical Report, Department of Mathematical Sciences, Rensselear Polytechnic Institute, Troy, New York.
18. Krishnan K. and Mitchell, J.E., 2003, Properties of a cutting plane algorithm for semidefinite programming. Technical Report, Department of Mathematical Sciences, Rensselear Polytechnic Institute, Troy, New York.
19. Krishnan K. and Mitchell, J.E., 2003, An unifying framework for several cutting plane methods for semidefinite programming. Technical Report, Department of Computational and Applied Mathematics, Rice University, Optimization Methods and Software, in press.
20. Nesterov, Y. and Nemirovskii, A., 1994, Interior-point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics, 13.
21. Vandenberghe L. and Boyd, S., 1996, Semidefinite Programming. SIAM Reviews, 38(1), 49-95.
22. Lobo, M.S., Vandenberghe L., Boyd, S. and Lebret H., 1987, Applications of second-order cone programming. Linear Algebra Applications 284(1-3), 193-228.
23. Rockafellar, R.T., 1974, Conjugate duality and optimization. CBMS-NSF Regional conference series in applied mathematics, SIAM.
24. Shapiro, A. 2001, On duality theory of conic linear problems. In: M.A. Goberna et al. (Eds) Semi-Infinite Programming. Recent advances (Dordrecht: Kluwer Academic Publishers); Nonconvex Optimization and its Applications, 57, 135-165.
25. Borwein, J.M., 1981, Direct theorems in semi-infinite convex programming. Mathematical Programming, 21, 301-318.
26. Gómez, W. and Gómez, J.A., 2004, Solving some special cases of inexact linear programming problems via cutting plane methods. Technical Report 2004-04, Department of Mathematical Engineering, University of Concepción, Chile.
27. Faigle, U., Kern, W. and Still, G., 2002, Algorithmic Principles of Mathematical Programming (Kluwer).
28. Ben Tal, A. and Nemirovski, A., 1998, Robust convex optimization. Mathematics of Operations Research, 23(4), 769-805.