Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming

Optimization Methods and Software

Volumn 23, Issue 4, 2008, Pages 609-629

  Pham Dinh, T ^a   Le Thi, H A ^b   Akoa, F ^b  

^a Avenue de l Université 76801 Saint Etienne du Rouvray   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

DC programming; DC regularization; DCA (DC Algorithms); Exact penalty; Interior point; Merit function; Nonconvex quadratic programming; Quasidefinite matrix

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; LEARNING SYSTEMS; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; SEARCH ENGINES;

COMPUTATIONAL TESTING; D-C PROGRAMMING; INTERIOR POINT; LINEAR COMPLEMENTARITY PROBLEMS (LCP); MACHINE-LEARNING; NON CONVEX QUADRATIC PROGRAMMING; NONCONVEX QUADRATIC PROGRAMS; NUMERICA L RESULTS; OPTIMAL SOLUTIONS; PRIMAL-DUAL; REGULARIZATION TECHNIQUES;

QUADRATIC PROGRAMMING;

EID: 47249091289     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780802263990     Document Type: Article

References (47)

1. F. Akoa, Approches de point int'erieur et de la programmation DC en optimisation non convexe. Codes et simulations num'eriques industrielles. PhD Thesis, National Institute for Applied Sciences (INSA), Rouen, France, 2005.
2. I. Akrotirianakis and B. Rustem, A primal-dual interior point algorithm with an exact differentiate merit function for general nonlinear programming problems, Optim. Methods Softw. 14 (2000), pp. 1-36.
3. A. Airman and J. Gondzio, Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization, Tech. Rep., Logilab, 1998.
4. R. Barrett, M. Berry, T.R Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. Van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd ed. SIAM, Philadelphia, PA, 1994.
5. I. Bongartz, A. Conn, N. Gould, and Ph. L. Toint, Constrained and unconstrained testing envimnment. ACM Trans. Math. Softw, 21.
6. J.R Bonnans, J.Ch. Gilbert, C Lemarechal, and C. Sagastizabal, Numerical Optimization - Theoretical and Practical Aspects, Springer Verlag, Berlin, 2001.
7. L. Chauvier, A. Fuduli, and J.Ch. Gilbert, A truncated SQP algorithm for solving nonconvex equality constrained optimization problems. in High Performance Algorithms and Software for Nonlinear Optimization, G. Di Pillo and A. Murli eds., Kluwer Academic Publishers, Erice, Italy, 2003, pp. 146-173.
8. Y. Chen and Y. Ye, On smoothing method for the PO matrix linear complementarity problem, SIAM J. Optim. 11 (2000), pp. 341-363.
9. A. Conn, N. Gould, and Ph.L. Toint, Trust Region Methods, MPS-SIAM Series on Optimization, Vol. 1, 2000.
10. R.W. Cottle, J.S. Pang, and R.E. Stone, The Linear Complementarity Problem, Academic Press. Boston, 1992.
11. R Facchinei and J.S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer Verlag, New York, 2003.
12. M.C. Ferris, O.L. Mangasarian, J.S. Pang, (Eds.), Complementarity: Applications, Algorithms and Extensions, Kluwer Academic Publishers, Dordrecht, 2001.
13. M.C. Ferris and T.S. Munson, Interior-point methods for massive support vector machines, SIAM J. Optim. 13 (2003), pp. 783-804.
14. M.C. Ferris and J.S. Pang (Eds.), Complementary and variational problems, state of the art, Proceedings of the International Conference on Complementarity Problems SIAM, 1995.
15. C.A. Floudas and V. Visweswaran, Quadratic optimization, in R. Horst and P.M. Pardalos, eds., Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London, 1995, pp. 217-270.
16. D.M. Gay, M.L. Overton, and M.H.Wright, Primal-dual interior point methods for nonconvex nonlinear programming, in Y. Yuan, ed., Advances in Nonlinear Programming, Kluwer Academic Publishers. Dordtrecht, 1998, pp. 341-407.
17. J.B. Hiriart Urruty and C Lemarechal, Convex Analysis and Minimization Algorithms, Springer Verlag, Berlin, Heidelberg, 1993.
18. H. A. Le Thi, Analyse numerique des algorithmes de l'optimisation DC: Approches locale et globale. PhD Thesis, University of Rouen, 1994.
19. _, Contribution a l'optimisation non convexe et l'optimisation globale: Theorie, Algorithmes et Applications. Habilitation a Diriger des Recherches (HDR), Universit'e de Rouen, 1997.
20. H.A. Le Thi and T. Pham Dinh. Solving a class of linearly constrained indefinite quadratic problems by DC algorithms, J. Global Optim. 11 (1997), pp. 253-285.
21. _. A branch and bound method via DC optimization algorithm and ellipsoidal techniques for box constrained nonconvex quadratic programming problems, J. Global Optim. 13 (1998), pp. 171-206.
22. _, DC programming: theory, algorithms and applications. The state of the art (28 pages). Proceedings of the First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos' 02), Valbonne-Sophia Antipolis, France, October 2-4, 2002.
23. _, DC programming and DCA for solving linear complementarity problems. Tech. Rep. laboratory of modelling, optimization and operations research, National Institute for Applied Sciences (INSA), Rouen, 2003.
24. _, Large scale molecular optimization from distances matrices by a DC optimization approach, SIAM J. Optim. 14 (2003), pp. 77-116.
25. _. The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Ann. Oper. Res. 133 (2005), pp. 23-46.
26. H. A. Le Thi, T. Pham Dinh, and R Akoa, An interior point algorithm with DC regularization (IPDCA) for nonlinear programming. Tech. Rep. laboratory of modelling, optimization and operations research, National Institute for Applied Sciences (INSA), Rouen, 2005.
27. R.B. Lehoucq, D.C. Sorensen, and C Yang, it ARPACK User's Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, 1997.
28. P. Mahey and T. Pham Dinh, Proximal decomposition on the graph of a maximal monotone operator, SIAM J. Optim. 5 (1995), pp. 454-468.
29. D.Q. Mayne and E. Polak, A superlinearly convergent algorithm for constrained optimization problems, Math. Program. Study 16 (1982), pp. 45-61.
30. K.A. McShane, CL. Monna, and D.F. Shanno, An implementation of primal-dual interior point method for linear programming, ORSAJ. Comput. 1(2) (1989), pp. 70-83.
31. J. Nocedal and S.J. Wright, Numerical Optimization, Springer Series in Operations Research. Springer-Verlag, 1999.
32. T. Pham Dinh and H.A. Le Thi, Convex analysis approach to DC programming: theory, algorithms and applications, Acta Math. Vietnamka 22(1) (1997), pp. 289-355.
33. _. DC optimization algorithms for solving the trust region subproblem, SIAM J. Optim. 8 (1998), pp. 476-505.
34. B. Polyak, Introduction to Optimization, Optimization Software, Inc., Publication Division, New York, 1987.
35. R.T. Rockafellar, Convex Analysis. Princeton University, Princeton, 1970.
36. _, Monotone opemtors and the pmximai point algorithm, SIAM J. Control Optim. 14 (1976), pp. 877-898.
37. Y. Saad. Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM, Philadelpha, PA, 2003.
38. M. Saunders, Cholesky-based methods for sparse least squares: the benefits of regularization, in L. Adams and L. Nazareth, eds., Linear and Nonlinear Conjugate Gradient-Related Methods, SIAM Philadelphia. USA, 1996, pp. 92-100.
39. M. Saunders and J.A. Tomlin. Solving regularized linear programs using barrier methods and KKT systems. Tech. Rep. SOL 96-4, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA 94305, USA, 1996.
40. R.J. Vanderbei. Symmetric quasi-definite matrices, SIAM J. Optim. 5 (1995), pp. 100-113.
41. _. Linear Programming: Foundations and Extenuons, Kluwer, Boston Massachusetts, 1996.
42. _. LOQO: An interior point code for quadratic programming. Optim. Methods Softw. 12 (1999), pp. 451-484.
43. _. LOQO user's manual version 4.05, operations research andfinancial engineering. Tech. Rep. No. ORFE-99, 2002.
44. R.J. Vanderbei and D. Shanno, An interior-point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl. 13 (1999), pp. 231-252.
45. H.Yamashita, A globally convergent primal-dual interior point method for constrained optimization, Optim. Methods Softw. 10 (1998), pp. 443-469.
46. H. Yamashita and H. Yabe, Super-linear and quadratic convergence of some primal-dual interior point methods for constrained optimization. Math. Prog.75 (1996), pp. 377-397.
47. YB. Zhao and D. Li, A globally and locally superlinearly convergent non-interior-point algorithm for PO LCPs, SIAM J. Optim. 13 (2003), pp. 1195-1221.