Exact regularization of convex programs

SIAM Journal on Optimization

Volumn 18, Issue 4, 2007, Pages 1326-1350

  Friedlander, Michael P ^a   Tseng, Paul ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Conic program; Convex program; Degeneracy; Exact penalization; Interior point algorithms; Lagrange multiplier; Linear program; Regularization; Sparse solutions

Indexed keywords

CONIC PROGRAM; CONVEX PROGRAM; DEGENERACY; EXACT PENALIZATION; INTERIOR-POINT ALGORITHMS; LINEAR PROGRAM; REGULARIZATION; SPARSE SOLUTIONS;

COERCIVE FORCE; FREQUENCY MULTIPLYING CIRCUITS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; MAGNETIC PROPERTIES; SOLUTIONS; SPACECRAFT;

PROBLEM SOLVING;

EID: 56749091502     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/060675320     Document Type: Article

References (48)

1. A. ALTMAN AND J. GONDZIO, Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization, Optim. Methods Softw., 11 (1999), pp. 275-302.
2. F. R. BACH, R. THIBAUX, AND M. I. JORDAN, Computing regularization paths for learning multiple kernels, in Advances in Neural Information Processing Systems (NIPS) 17, L. Saul, Y. Weiss, and L. Bottou, eds., Morgan Kaufmann, San Mateo, CA, 2005.
3. A. BEN-TAL AND A. NEMIROVSKI, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS/SIAM Ser. Optim. 2, SIAM, Philadelphia, 2001.
4. D. P. BERTSEKAS, Necessary and sufficient conditions for a penalty method to be exact, Math. Programming, 9 (1975), pp. 87-99.
5. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
6. D. P. BERTSEKAS, A note on error bounds for convex and nonconvex programs, Comput. Optim. Appl., 12 (1999), pp. 41-51.
7. D. P. BERTSEKAS, A. NEDIĆ, AND A. E. OZDAGLAR, Convex Analysis and Optimization, Athena Scientific, Belmont, MA, 2003.
8. S. BOYD AND L. VANDENBERGHE, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
9. J. V. BURKE, An exact penalization viewpoint of constrained optimization, SIAM J. Control Optim., 29 (1991), pp. 968-998.
10. J. V. BURKE AND S. DENG, Weak sharp minima revisited. II. Application to linear regularity and error bounds, Math. Program., 104 (2005), pp. 235-261.
11. J. V. BURKE AND M. C. FERRIS, Weak sharp minima in mathematical programming, SIAM J. Control Optim., 31 (1993), pp. 1340-1359.
12. E. J. CANDES, J. ROMBERG, AND T. TAO, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59 (2006), pp. 1207-1223.
13. E. J. CANDÉS, J. ROMBERG, AND T. TAO, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509.
14. S. S. CHEN, D. L. DONOHO, AND M. A. SAUNDERS, Atomic decomposition by basis pursuit, SIAM Rev., 43 (2001), pp. 129-159.
15. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Trust-Region Methods, MPS-SIAM Ser. Optim. 1, SIAM, Philadelphia, 2000.
16. 1 minimization, Proc. Natl. Acad. Sci. USA, 100 (2003), pp. 2197-2202.
17. D. L. DONOHO, M. ELAD, AND V. TEMLYAKOV, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inform. Theory, 52 (2006), pp. 6-18.
18. D. L. DONOHO AND J. TANNER, Sparse nonnegative solution of underdetermined linear equations by linear programming, Proc. Natl. Acad. Sci. USA, 102 (2005), pp. 9446-9451.
19. B. EFRON, T. HASTIE, I. JOHNSTONE, AND R. TIBSHIRANI, Least angle regression, Ann. Statist., 32 (2004), pp. 407-499.
20. M. C. FERRIS AND O. L. MANGASARIAN, Finite perturbation of convex programs, Appl. Math. Optim., 23 (1991), pp. 263-273.
21. 1 penalty method for nonlinear constraints, in Numerical Optimization, 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, eds., SIAM, Philadelphia, 1985, pp. 26-40.
22. R. FLETCHER, Practical Methods of Optimization, 2nd ed., John Wiley and Sons, Chichester, UK, 1987.
23. C. C. GONZAGA, Generation of Degenerate Linear Programming Problems, Tech. report, Department of Mathematics, Federal University of Santa Catarina, Santa Catarina, Brazil, 2003.
24. S.-P. HAN AND O. L. MANGASARIAN, Exact penalty functions in nonlinear programming, Math. Programming, 17 (1979), pp. 251-269.
25. C. KANZOW, H. QI, AND L. QI, On the minimum norm solution of linear programs, J. Optim. Theory Appl., 116 (2003), pp. 333-345.
26. S. LUCIDI, A finite algorithm for the least two-norm solution of a linear program, Optimization, 18 (1987), pp. 809-823.
27. S. LUCIDI, A new result in the theory and computation of the least-norm solution of a linear program, J. Optim. Theory Appl., 55 (1987), pp. 103-117.
28. Z.-Q. LUO AND J.-S. PANG, Error bounds for analytic systems and their applications, Math. Programming, 67 (1994), pp. 1-28.
29. Z.-Q. LUO AND J.-S. PANG, eds., Error bounds in mathematical programming, Math. Program., 88 (2000), pp. 221-410.
30. O. L. MANGASARIAN, Normal solutions of linear programs, Math. Programming Stud., 22 (1984), pp. 206-216.
31. O. L. MANGASARIAN, Sufficiency of exact penalty minimization, SIAM J. Control Optim., 23 (1985), pp. 30-37.
32. O. L. MANGASARIAN, A simple characterization of solution sets of convex programs, Oper. Res. Lett., 7 (1988), pp. 21-26.
33. O. L. MANGASARIAN, A Newton method for linear programming, J. Optim. Theory Appl., 121 (2004), pp. 1-18.
34. O. L. MANGASARIAN AND R. R. MEYER, Nonlinear perturbation of linear programs, SIAM J. Control Optim., 17 (1979), pp. 745-752.
35. Y. E. NESTEROV AND A. NEMIROVSKI, Interior Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
36. NETLIB Linear Programming Library, available online at http://www.netlib.org/lp/infeas/, 2006.
37. G. PATAKI AND S. SCHMIETA, The DIMACS Library of Semidefinite-Quadratic-Linear Programs, Tech. report preliminary draft, Computational Optimization Research Center, Columbia University, New York, 2002.
38. J. RENEGAR, A Mathematical View of Interior-Point Methods in Convex Optimization, MPS/SIAM Ser. Optim. 3, SIAM, Philadelphia, 2001.
39. S. M. ROBINSON, Local structure of feasible sets in nonlinear programming. II. Nondegeneracy, Math. Programming Stud., 22 (1984), pp. 217-230.
40. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
41. S. SARDY AND P. TSENG, On the statistical analysis of smoothing by maximizing dirty Markov random field posterior distributions, J. Amer. Statist. Assoc., 99 (2004), pp. 191-204.
42. M. A. SAUNDERS, Cholesky-based methods for sparse least squares: The benefits of regularization, in Linear and Nonlinear Conjugate Gradient-Related Methods, L. Adams and J. L. Nazareth, eds., SIAM, Philadelphia, 1996, pp. 92-100.
43. J. F. STURM, Using Sedumi 1.02, a Matlab Toolbox for Optimization over Symmetric Cones (updated for Version 1.05), Tech. report, Department of Econometrics, Tilburg University, Tilburg, The Netherlands, 2001.
44. R. TIBSHIRANI, Regression shrinkage and selection via the Lasso, J. Roy. Statist. Soc. Ser. B, 58 (1996), pp. 267-288.
45. A. N. TIKHONOV AND V. Y. ARSENIN, Solutions of Ill-Posed Problems, V. H. Winston and Sons, Washington, DC, 1977 (translated from Russian).
46. Z. WU AND J. J. YE, On error bounds for lower semicontinuous functions, Math. Program., 92 (2002), pp. 301-314.
47. Y. YE, Interior-Point Algorithms: Theory and Analysis, John Wiley and Sons, New York, 1997.
48. Y.-B. ZHAO AND D. LI, Locating the least 2-norm solution of linear programs via a path-following method, SIAM J. Optim., 12 (2002), pp. 893-912.