A conic duality Frank-Wolfe-type theorem via exact penalization in quadratic optimization

Mathematics of Operations Research

Volumn 34, Issue 1, 2009, Pages 83-91

  Schachinger, Werner ^a   Bomze, Immanuel ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Copositive programming; Dual attainability

Indexed keywords

CONIC PROGRAM; CONVEX CONSTRAINTS; COPOSITIVE PROGRAMMING; DUAL ATTAINABILITY; EXACT PENALIZATION; LINEAR CONSTRAINTS; OPTIMAL VALUES; POSITIVE SEMIDEFINITENESS; PRIMAL-DUAL; QUADRATIC FUNCTION; QUADRATIC OBJECTIVE FUNCTIONS; QUADRATIC OPTIMIZATION; QUADRATIC PROGRAMS;

OPTIMIZATION;

EID: 67649984882     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0345     Document Type: Article

References (15)

1. Belousov, E. G., D. Klatte. 2002. A Frank-Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22 37-48.
2. Bomze, I. M., W. Schachinger. 2007. Multi-standard quadratic optimization problems. Technical Report TR-ISDS 2007-12, University of Vienna, Vienna. http://www.optimization-online.org/DB-HTML/2007/11/1843.html.
3. Boyd, S., L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press, Cambridge, UK.
4. Burer, S. 2006. On the copositive representation of binary and continuous nonconvex quadratic programs. Preprint, University of Iowa, Ames. http://www.optimization-online.org/DB-HTML/2006/10/1501.html.
5. Friedlander, M. P., P. Tseng. 2006. Exact regularization of convex programs. Technical Report TR-2006-26, Department of Computer Science, University of British Columbia, Vancouver. http://www.optimization-online.org/ DB-HTML/2006/11/1531.html.
6. Hadeler, K. P. 1983. On copositive matrices. Linear Algebra Appl. 49 79-89.
7. Hummel, R. A., S. W. Zucker. 1983. On the foundations of relaxation labeling processes. IEEE Trans. Pattern Anal. Machine Intelligence 5 267-287.
8. Luo, Z.-Q., P. Tseng. 1992. Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2 43-54.
9. Luo, Z.-Q., Sh. Zhang. 1999. On extensions of the Frank-Wolfe theorems. Comput. Optim. Appl. 13 87-110.
10. Monteiro, R. D. C., Y. Wang. 1998. Trust region affine scaling algorithms for linearly constrained convex and concave programs. Math. Programming 80 283-313.
11. Nocedal, J., S. Wright. 2006. Numerical Optimization, 2nd ed. Springer, New York.
12. Ozdaglar, A., P. Tseng. 2006. Existence of global minima for constrained optimization. J. Optim. Theory Appl. 128 523-546.
13. Pataki, G. 2006. On the closedness of the linear image of a closed convex cone. Preprint, University of North Carolina, Chapel Hill. http://www. optimization-online.org/DB-HTML/2006/12/1556.html.
14. Pelillo, M. 1997. The dynamics of nonlinear relaxation labeling processes. J. Math. Imaging Vision 7 309-323.
15. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.