Primal-dual nonlinear rescaling method for convex optimization

Journal of Optimization Theory and Applications

Volumn 122, Issue 1, 2004, Pages 111-156

  Polyak, R ^a   Griva, I ^a  

^a Krasnow Institute for Advanced Study   (United States)

Author keywords

duality; Lagrangian; multipliers methods; Nonlinear rescaling; primal dual methods

Indexed keywords

CONSTRAINED OPTIMIZATION; ERROR ANALYSIS; LAGRANGE MULTIPLIERS;

CONVEX OPTIMISATION; DUALITY; ERROR BOUND; LAGRANGIAN; MULTIPLIERS METHOD; NONLINEAR RESCALING; PRIMAL-DUAL; PRIMAL-DUAL METHODS; RESCALING; RESCALING METHOD;

CONVEX OPTIMIZATION;

EID: 9744286945     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOTA.0000041733.24606.99     Document Type: Article

References (32)

1. WRIGHT, S., Primal-Dual Interior Points Methods, SIAM, Philadelphia, Pennsylvania 1997.
2. MEGIDDO, N., Pathways to the Optimal Set in Linear Programming, Interior Point and Related Methods, Edited by N. Megiddo, Springer Verlag, New York, NY, pp. 131-158,1989.
3. MEHROTRA, S., On Implementation of a Primal-Dual Interior-Point Method, SIAM Journal on Optimization, Vol. 2, pp. 575-601, 1992.
4. POTRA, F., and WRIGHT, S., Interior-Point Methods, Technical Report, Department of Mathematics and Statistics, University of Maryland Baltimore County, 1999.
5. LUSTIG, I., MARSTEN, R., and SHANNO, D., Computational Experience with a Globally Convergent Primal-Dual Predictor-Corrector Algorithm for Linear Programming, Mathematical Programming, Vol. 66, pp. 23-135, 1994.
6. VANDERBEI, R., Symmetric Quasidefinite Matrices, SIAM Journal on Optimization, Vol. 5, pp. 100-113, 1995.
7. ZHANG, Y., Solving Large-Scale Linear Programs by Interior-Point Methods under MATLAB Environment, Department of Computational and Applied Mathematics, Rice University, 1996.
8. ZHANG, Y., TAPTIA, R., and DENNIS, J., On the Superlinear and Quadratic Convergence of Primal-Dual Interior-Point Linear Programming Algorithms, SIAM Journal on Optimization, Vol. 2, pp. 304-324, 1992.
9. FORSGREN, A., and GILL, P., Primal-Dual Interior Methods for Nonconvex Nonlinear Programming, SIAM Journal on Optimization, Vol. 8, pp. 1132-1152, 1998.
10. GAY, D., OVERTON, M., and WRIGHT, M., A Primal-Dual Interior Method for Nonconvex Nonlinear Programming, Technical Report 97-4-08, Computing Science Research Center, Bell Laboratories, Murray Hill, New Jersey, 1997.
11. NOCEDAL, J., and WRIGHT, S., Numerical Optimization, Springer, New York, NY, 1999.
12. SHANNO, D.F., and VANDERBEI, R.J., An Interior-Point Algorithm for Nonconvex Nonlinear Programming, Computational Optimization and Applications, Vol. 13, pp. 231-252, 1999.
13. POLYAK, R., Modified Barrier Functions, Mathematical Programming, Vol. 54, 177-222, 1992.
14. POLYAK, R., and TEBOULLE, M., Nonlinear Rescaling and Proximal-Like Methods in Convex Optimization, Mathematical Programming, Vol. 76 pp. 265-284, 1997.
15. POLYAK, R., GRIVA, I., and SOBIESKI, J., The Newton Log-Sigmoid Method in Constrained Optimization, A Collection of Technical Papers, 7th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Vol. 3, pp. 2193-2201, 1998.
16. POLYAK, R., Log-Sigmoid Multipliers Method in Constrained Optimization, Annals of Operations Research, Vol. 101, pp. 427-460, 2001.
17. POLYAK, R., Nonlinear Rescaling vs. Smoothing Technique in Convex Optimization, Mathematical Programming, Vol. 92A, pp. 197-235, 2002.
18. BONDARENKO, A.S., BORTZ, D.M., and MORE, J.J., COPS: Large-Scale Nonlinearly Constrained Optimization Problems, Technical Report ANL/MCS-TM-237, Mathematics and Computer Science Division, Argonne National Laboratory, 1999.
19. AUSLENDER, A., COMINETTT, R., and HADDOU, M., Asymptotic Analysis for Penalty and Barrier Methods in Convex Inequalities and Linear Complementary Problems, Mathematical Programming, Vol. 71, pp. 51-69, 1995.
20. CHEN, C., and MANGASARIAN, O., Smoothing Methods for Convex Inequalities and Linear Complementary Problems, Mathematical Programming, Vol. 71, pp. 51-69, 1995.
21. FIACCO, A., and MCCORMICK, G., Nonlinear Programming: Sequential Unconstrained Minimization Techniques, SIAM Classics in Applied Mathematics, SIAM, Philadelphia, Pennsylvania, 1990.
22. KORT, B. W., and BERTSEKAS, D. P., Multiplier Methods for Convex Programming, Proceedings of IEEE Conference on Decision and Control, San Diego, California, pp. 428-432, 1973.
23. BEN-TAL, A., YUZEFOVICH, I., and ZIBULEVSKI, M., Penalty/Barrier Multiplier Method for Minimax and Constrained Smooth Convex Problems, Research Report 9/92, Optimization Laboratory, Faculty of Industrial Engineering and Management, Technion, Israel, 1992.
24. BREITFELT, M., and SHANNO, D., Experience with Modified Log-Barrier Method for Nonlinear Programming, Annals of Operations Research, Vol. 62, 439-464, 1996.
25. NG, E., and PEYTON, B. W., Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers, SIAM Journal on Scientific Computing, Vol. 14, pp. 1034-1056, 1993.
26. POLYAK, R., and Griva, I., Nonlinear Rescaling in Constrained Optimization: Primal-Dual approach, Technical Report SEOR-02-05, Fairfax, Virginia, 2002; see http://mason.gmu.edu/~rpolyak/papers.html.
27. SMALE, S., Newton's Method Estimates from Data at One Point, The Merging of Disciplines in Pure, Applied, and Computational Mathematics, Edited by R.E. Ewing, Springer, New York, NY, pp. 185-196, 1986.
28. TICHONOV, A., and ARSENIEV, V., Methods de Resolution de Problemes Mal Posés, MIR, Moscow, Russia, 1974.
29. DEBREU, G., Definite and Semifinite Quadratic Forms, Econometrica, Vol. 20, pp. 295-300, 1952.
30. KANTOROVICH, L.V., Functional Analysis and Applied Mathematics, Uspekhi Mathematicheskikh Nauk, Vol. 3, pp. 89-185, 1948.
31. NESTEROV, Yu., and NEMIROVSKY, A., Self-Concordant Functions and Polynomial-Time Methods in Convex Programming, CEMI Academy of Sciences, Moscow, Russia, 1989.
32. POLYAK, B. T., Introduction to Optimization, Software, New York, NY, 1987.