A characterization of the optimal set of linear programs based on the augmented lagrangian

References

• Bertsekas , D. P. 1976 . “ Newton’s method for linear optimal control problems ” . In Proceedings of the Symposium on Large Scale Systems 353 – 359 . Udine in, 1976
   Google Scholar
• Bertsekas , D. P. 1982 . Constrained Optimization and Lagrange Multiplier Methods , New York : Academic Press .
   Google Scholar
• Bertsekas , D. P. and Tsitsiklis , J. N. 1989 . Parallel and Distributed Computation: Numerical Methods , Englewood Cliffs , New Jersey : Prentice-Hall .
   Google Scholar
• Güler , O. 1992 . Augmented lagrangian algorithms for linear programming . J. Optim. Theory and Applics. , 75 : 445 – 470 .
   Web of Science ®Google Scholar
• Wright , S. J. 1990 . Implementing proximal point methods for linear programming . J. Optim. Theory and Applics. , 65 : 531 – 551 .
   Google Scholar
• Rockafellar , T. R. 1976 . Augmented lagrangians and applications of proximal point algorithm in convex programming . Math. O.R. , 1 : 97 – 116 .
   Google Scholar
• Rockafellar , T. R. 1973 . The multiplier method of Hestenes and Powell applied to convex programming . J. Optim. Theory and Applics. , 12 : 555 – 562 .
   Web of Science ®Google Scholar
• Rockafellar , T. R. 1973 . A dual approach to solving nonlinear programming problems by unconstrained optimization . Math. Programming , 5 : 354 – 373 .
   Google Scholar
• Hestenes , M. R. 1969 . Multiplier and gradient methods . J. Optim. Theory and Applics. , 4 : 303 – 320 .
   Google Scholar
• Powell , M. J. D. 1969 . “ A method for nonlinear constraints in minimization problems ” . In Optimization , Edited by: Fletcher , R. 283 – 298 . New York : Academic Press . in
   Google Scholar
• Pinar , M. C. 1996 . Minimization of the quadratic augmented lagrangian function in linear programming , Technical Report Bilkent, Ankara , Turkey : Department of Industrial Engineering, Bilkent University, 06533 .
   Google Scholar
• Pinar , M. C. 1994 . Piecewise linear pathways to the optimal solution set in linear programming , Technical Report 94–01 Institute of Mathematical Modelling, Technical University of Denmark . revised August 1995 (to appear in J. Optim. Theory and Applics.)
   Google Scholar
• Madsen , K. , Nielsen , H. B. and Pinar , M. C. 1994 . New characterizations of l 1 solutions to overdetermined systems of linear equations . O.R. Letters , 16 : 159 – 166 .
   Google Scholar
• Madsen , K. , Nielsen , H. B. and Pinar , M. C. 1996 . A new finite continuation algorithm for linear programming . SIAM J. on Optimization , 6 August : 1996
   Google Scholar
• Ferris , M. C. 1991 . Finite termination of the proximal point algorithm . Math. Programming , 50 : 359 – 366 .
   Web of Science ®Google Scholar
• Teboulle , M. 1992 . Entropic proximal mappings with applications to nonlinear programming . Math. O.R. , 17 : 670 – 690 .
   Web of Science ®Google Scholar
• Eckstein , J. 1993 . Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming . Math. O.R. , 18 : 202 – 226 .
   Web of Science ®Google Scholar
• Censor , Y. and Zenios , S. A. 1992 . The proximal minimization algorithm with D-functions . J. Optim. Theory and Applics. , 73 : 451 – 466 .
   Web of Science ®Google Scholar
• Tseng , P. and Bertsekas , D. P. 1993 . On the convergence of the exponential multiplier method for convex programming . Math. Programming , 60 : 1 – 19 .
   Web of Science ®Google Scholar