Basic Properties of Linear Programs

[1]  Bingsheng He,et al.  The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent , 2014, Mathematical Programming.

[2]  Lin Xiao,et al.  On the complexity analysis of randomized block-coordinate descent methods , 2013, Mathematical Programming.

[3]  Leonid Hurwicz.  Programming in Linear Spaces , 2014 .

[4]  Renato D. C. Monteiro,et al.  Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers , 2013, SIAM J. Optim..

[5]  Yurii Nesterov,et al.  Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems , 2012, SIAM J. Optim..

[6]  Bingsheng He,et al.  On the O(1/n) Convergence Rate of the Douglas-Rachford Alternating Direction Method , 2012, SIAM J. Numer. Anal..

[7]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[8]  Zizhuo Wang,et al.  A Unified Framework for Dynamic Prediction Market Design , 2011, Oper. Res..

[9]  Zhi-Quan Luo,et al.  Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.

[10]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[11]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[12]  Monique Laurent,et al.  Matrix Completion Problems , 2009, Encyclopedia of Optimization.

[13]  Anthony Man-Cho So,et al.  A Unified Theorem on Sdp Rank Reduction , 2008, Math. Oper. Res..

[14]  Arkadi Nemirovski,et al.  Structural Design via Semidefinite Programming , 2008 .

[15]  P. Brandimarte.  Finite Difference Methods for Partial Differential Equations , 2006 .

[16]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[17]  Yinyu Ye,et al.  A New Complexity Result on Solving the Markov Decision Problem , 2005, Math. Oper. Res..

[18]  Roger Fletcher,et al.  Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming , 2005, Numerische Mathematik.

[19]  Anthony Man-Cho So,et al.  Theory of semidefinite programming for Sensor Network Localization , 2005, SODA '05.

[20]  Tamás Terlaky,et al.  A Long-step barrier method for convex quadratic programming , 1993, Algorithmica.

[21]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[22]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[23]  R. Freund.  Review of A mathematical view of interior-point methods in convex optimization, by James Renegar, SIAM, Philadelphia, PA , 2004 .

[24]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[25]  Donald Goldfarb,et al.  Robust Portfolio Selection Problems , 2003, Math. Oper. Res..

[26]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[27]  Timothy H. McNicholl.  Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag. , 2001, SIGA.

[28]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[29]  Alexander I. Barvinok,et al.  A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints , 2001, Discret. Comput. Geom..

[30]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[31]  Reha H. Tütüncü,et al.  An infeasible-interior-point potential-reduction algorithm for linear programming , 1999, Math. Program..

[32]  Yinyu Ye,et al.  On a homogeneous algorithm for the monotone complementarity problem , 1999, Math. Program..

[33]  Yinyu Ye,et al.  Approximating quadratic programming with bound and quadratic constraints , 1999, Math. Program..

[34]  Michael J. Todd,et al.  Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems , 1999, Math. Program..

[35]  Henry Wolkowicz,et al.  Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming , 1999, Comput. Optim. Appl..

[36]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[37]  Z. Luo,et al.  Conic convex programming and self-dual embedding , 1998 .

[38]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

[39]  Gábor Pataki,et al.  On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues , 1998, Math. Oper. Res..

[40]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[41]  Y. Nesterov.  Semidefinite relaxation and nonconvex quadratic optimization , 1998 .

[42]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[43]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[44]  Y. Ye,et al.  Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics , 1998 .

[45]  Etienne de Klerk,et al.  Initialization in semidefinite programming via a self-dual skew-symmetric embedding , 1997, Oper. Res. Lett..

[46]  Motakuri V. Ramana,et al.  An exact duality theory for semidefinite programming and its complexity implications , 1997, Math. Program..

[47]  Yinyu Ye,et al.  An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications , 1997, SIAM J. Optim..

[48]  Henry Wolkowicz,et al.  Strong Duality for Semidefinite Programming , 1997, SIAM J. Optim..

[49]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[50]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[51]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[52]  Yin Zhang,et al.  On polynomiality of the Mehrotra-type predictor—corrector interior-point algorithms , 1995, Math. Program..

[53]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[54]  Levent Tunçel,et al.  Constant potential primal—dual algorithms: A framework , 1994, Math. Program..

[55]  Dick den Hertog,et al.  Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity , 1994 .

[56]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[57]  Robert E. Bixby,et al.  Commentary - Progress in Linear Programming , 1994, INFORMS J. Comput..

[58]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

[59]  Robert E. Bixby,et al.  Progress in Linear Programming , 1993 .

[60]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[61]  F. Jarre.  Interior-point methods for convex programming , 1992 .

[62]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[63]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[64]  C. C. Gonzaga,et al.  An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming , 1992, SIAM J. Optim..

[65]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..

[66]  Liqun Qi,et al.  An interior point algorithm of $$O(\sqrt m \left| {\ln \varepsilon } \right|)$$ iterations forC1-convex programming , 1992, Math. Program..

[67]  Michael J. Todd.  A Low Complexity Interior-Point Algorithm for Linear Programming , 1992, SIAM J. Optim..

[68]  Paul Tseng,et al.  Complexity analysis of a linear complementarity algorithm based on a Lyapunov function , 1992, Math. Program..

[69]  Robert M. Freund,et al.  Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function , 1991, Math. Program..

[70]  Donald Goldfarb,et al.  A primal projective interior point method for linear programming , 1991, Math. Program..

[71]  Shinji Mizuno,et al.  An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..

[72]  Yinyu Ye,et al.  An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..

[73]  William C. Davidon,et al.  Variable Metric Method for Minimization , 1959, SIAM J. Optim..

[74]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[75]  Michael J. Todd,et al.  A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..

[76]  Pravin M. Vaidya,et al.  An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1987, Math. Program..

[77]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[78]  Shinji Mizuno,et al.  A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[79]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[80]  D. Bayer,et al.  The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .

[81]  D. Bayer,et al.  The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

[82]  C. C. Gonzaga,et al.  An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .

[83]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[84]  James Renegar,et al.  A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[85]  J. Borwein,et al.  Two-Point Step Size Gradient Methods , 1988 .

[86]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[87]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[88]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[89]  Kaoru Tone,et al.  Revisions of constraint approximations in the successive QP method for nonlinear programming problems , 1983, Math. Program..

[90]  M. Fortin,et al.  On decomposition - coordination methods using an augmented Lagrangian , 1983 .

[91]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[92]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[93]  D. Gabay.  Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization , 1982 .

[94]  Michael J. Todd,et al.  Feature Article - The Ellipsoid Method: A Survey , 1981, Oper. Res..

[95]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[96]  T. M. Williams,et al.  Practical Methods of Optimization. Vol. 1: Unconstrained Optimization , 1980 .

[97]  L. McLinden.  An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. , 1980 .

[98]  M. J. D. Powell,et al.  Algorithms for nonlinear constraints that use lagrangian functions , 1978, Math. Program..

[99]  David F. Shanno,et al.  Conjugate Gradient Methods with Inexact Searches , 1978, Math. Oper. Res..

[100]  R. Schnabel,et al.  Least Change Secant Updates for Quasi-Newton Methods , 1978 .

[101]  R. A. Tapia,et al.  QUASI-NEWTON METHODS FOR EQUALITY CONSTRAINED OPTIMIZATION: EQUIVALENCE OF EXISTING METHODS AND A NEW IMPLEMENTATION , 1978 .

[102]  M. C. Biggs.  On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming , 1978 .

[103]  C. Lemaréchal,et al.  Nonsmooth optimization : proceedings of a IIASA workshop, March 28-April 8, 1977 , 1978 .

[104]  N. Maratos,et al.  Exact penalty function algorithms for finite dimensional and control optimization problems , 1978 .

[105]  Robert G. Bland,et al.  New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..

[106]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[107]  Olvi L. Mangasarian,et al.  Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems , 1976, Math. Program..

[108]  Shmuel S. Oren,et al.  Optimal conditioning of self-scaling variable Metric algorithms , 1976, Math. Program..

[109]  D. Bertsekas.  Multiplier methods: A survey , 1975, Autom..

[110]  A. Tamir.  Line Search Techniques Based on Interpolating Polynomials using Function Values Only , 1976 .

[111]  Katta G. Murty,et al.  Linear and combinatorial programming , 1976 .

[112]  R. Fletcher.  Conjugate gradient methods for indefinite systems , 1976 .

[113]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[114]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[115]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[116]  R. Glowinski,et al.  Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires , 1975 .

[117]  D. Luenberger.  A combined penalty function and gradient projection method for nonlinear programming , 1974 .

[118]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[119]  D. Bertsekas.  Partial conjugate gradient methods for a class of optimal control problems , 1974 .

[120]  D. Luenberger,et al.  Self-Scaling Variable Metric (SSVM) Algorithms , 1974 .

[121]  S. Oren.  SELF-SCALING VARIABLE METRIC (SSVM) ALGORITHMS Part II: Implementation and Experiments*t , 1974 .

[122]  R. Rockafellar.  The multiplier method of Hestenes and Powell applied to convex programming , 1973 .

[123]  Roger Fletcher,et al.  An exact penalty function for nonlinear programming with inequalities , 1973, Math. Program..

[124]  D. Luenberger.  An approach to nonlinear programming , 1973 .

[125]  D. Luenberger.  The Gradient Projection Method Along Geodesics , 1972 .

[126]  P. Wolfe.  On the convergence of gradient methods under constraint , 1972 .

[127]  E. Polak,et al.  Computational methods in optimization : a unified approach , 1972 .

[128]  P. Gill,et al.  Quasi-Newton Methods for Unconstrained Optimization , 1972 .

[129]  L. C W. Dixon,et al.  Quasi-newton algorithms generate identical points , 1972, Math. Program..

[130]  J. Uhlig.  C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice-Hall, Inc. Preis geb. 54 s. net , 1972 .

[131]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[132]  M. Powell.  On the Convergence of the Variable Metric Algorithm , 1971 .

[133]  D. Luenberger.  Convergence rate of a penalty-function scheme , 1971 .

[134]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[135]  D. Luenberger.  Control problems with kinks , 1970 .

[136]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 2. The New Algorithm , 1970 .

[137]  D. Luenberger.  The Conjugate Residual Method for Constrained Minimization Problems , 1970 .

[138]  D. Shanno.  Conditioning of Quasi-Newton Methods for Function Minimization , 1970 .

[139]  H. Y. Huang.  Unified approach to quadratically convergent algorithms for function minimization , 1970 .

[140]  R. Rockafellar.  Convex Analysis: (pms-28) , 1970 .

[141]  J. Greenstadt.  Variations on variable-metric methods. (With discussion) , 1970 .

[142]  R. Fletcher,et al.  A New Approach to Variable Metric Algorithms , 1970, Comput. J..

[143]  J. Greenstadt.  Variations on Variable-Metric Methods , 1970 .

[144]  D. Goldfarb.  A family of variable-metric methods derived by variational means , 1970 .

[145]  M. Hestenes.  Multiplier and gradient methods , 1969 .

[146]  D. Luenberger.  Hyperbolic Pairs in the Method of Conjugate Gradients , 1969 .

[147]  Gene H. Golub,et al.  The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.

[148]  P. Wolfe.  Convergence Conditions for Ascent Methods. II , 1969 .

[149]  M. Powell.  A method for nonlinear constraints in minimization problems , 1969 .

[150]  R. Bartels.  A NUMERICAL INVESTIGATION OF THE SIMPLEX METHOD , 1968 .

[151]  D. D. Morrison.  Optimization by Least Squares , 1968 .

[152]  William C. Davidon,et al.  Variance Algorithm for Minimization , 1968, Comput. J..

[153]  G. Forsythe.  On the asymptotic directions of thes-dimensional optimum gradient method , 1968 .

[154]  M. R. Osborne,et al.  Methods for unconstrained optimization problems , 1968 .

[155]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[156]  C. G. Broyden.  Quasi-Newton methods and their application to function minimisation , 1967 .

[157]  A. F. Veinott,et al.  On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming , 1967 .

[158]  J. Daniel.  The Conjugate Gradient Method for Linear and Nonlinear Operator Equations , 1967 .

[159]  Arthur F. Veinott,et al.  The Supporting Hyperplane Method for Unimodal Programming , 1967, Oper. Res..

[160]  W. Zangwill.  Non-Linear Programming Via Penalty Functions , 1967 .

[161]  G. W. Stewart,et al.  A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives , 1967, JACM.

[162]  H. Keller,et al.  Analysis of Numerical Methods , 1967 .

[163]  S. Sinha.  A Duality Theorem for Nonlinear Programming , 1966 .

[164]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

[165]  L. Armijo.  Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[166]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[167]  A. Goldstein.  On Steepest Descent , 1965 .

[168]  J. Ortega,et al.  An introduction to numerical linear algebra , 1965 .

[169]  B. V. Shah,et al.  Some Algorithms for Minimizing a Function of Several Variables , 1964 .

[170]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[171]  C. M. Reeves,et al.  Function minimization by conjugate gradients , 1964, Comput. J..

[172]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[173]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[174]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[175]  D. R. Fulkerson,et al.  Flows in networks , 1962 .

[176]  Terence Butler,et al.  On a Method of Courant for Minimizing Functionals , 1962 .

[177]  J. B. Rosen.  The gradient projection method for nonlinear programming: Part II , 1961 .

[178]  P. Wolfe.  A duality theorem for non-linear programming , 1961 .

[179]  Charles W. Carroll.  The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems , 1961 .

[180]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[181]  A. S. Manne.  Linear Programming and Sequential Decisions , 1960 .

[182]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[183]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[184]  H. Akaike.  On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method , 1959 .

[185]  D. Faddeev,et al.  Computational Methods of Linear Algebra. , 1966, The Mathematical Gazette.

[186]  George B. Dantzig,et al.  7* A Primal-Dual Algorithm for Linear Programs , 1957 .

[187]  A. Orden.  The Transhipment Problem , 1956 .

[188]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[189]  H. Chernoff,et al.  Gradient methods of maximization. , 1955 .

[190]  W. Jacobs.  The caterer problem , 1954 .

[191]  G. Dantzig,et al.  Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints , 1954 .

[192]  C. E. Lemke,et al.  The dual method of solving the linear programming problem , 1954 .

[193]  W. Fenchel.  Convex cones, sets, and functions , 1953 .

[194]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[195]  A. Charnes.  Optimality and Degeneracy in Linear Programming , 1952 .

[196]  T. Koopmans.  Optimum Utilization of the Transportation System , 1949 .

[197]  H. B. Curry.  The method of steepest descent for non-linear minimization problems , 1944 .

[198]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[199]  Karl Löwner.  Über monotone Matrixfunktionen , 1934 .