A Unifying Polyhedral Approximation Framework for Convex Optimization

We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, but also includes new methods and new versions/extensions of old methods, such as a simplicial decomposition method for nondifferentiable optimization and a new piecewise linear approximation method for convex single commodity network flow problems. Our framework is based on an extended form of monotropic programming, a broadly applicable model, which includes as special cases Fenchel duality and Rockafellar's monotropic programming, and is characterized by an elegant and symmetric duality theory. Our algorithm combines flexibly outer and inner linearization of the cost function. The linearization is progressively refined by using primal and dual differentiation, and the roles of outer and inner linearization are reversed in a mathematically equivalent dual algorithm. We provide convergence results for the general case where outer and inner linearization are combined in the same algorithm.

[1]  Charles A. Holloway.  An extension of the frank and Wolfe method of feasible directions , 1974, Math. Program..

[2]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[3]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[4]  Balder Von Hohenbalken,et al.  Simplicial decomposition in nonlinear programming algorithms , 1977, Math. Program..

[5]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[6]  C. C. Gonzaga,et al.  On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms , 1979 .

[7]  R. Meyer.  Two-Segment Separable Programming , 1979 .

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

[9]  Jong-Shi Pang,et al.  Linearized simplicial decomposition methods for computing traffic equilibria on networks , 1984, Networks.

[10]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[11]  J. A. Ventura,et al.  Restricted simplicial decomposition: computation and extensions , 1987 .

[12]  Torbjörn Larsson,et al.  Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..

[13]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[14]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[15]  Jose A. Ventura,et al.  Restricted simplicial decomposition for convex constrained problems , 1993, Math. Program..

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

[17]  Remo Guidieri.  Res , 1995, RES: Anthropology and Aesthetics.

[18]  Elijah Polak,et al.  Optimization: Algorithms and Consistent Approximations , 1997 .

[19]  Ann-Brith Strömberg.  Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization , 1997 .

[20]  M. Patriksson,et al.  Ergodic convergence in subgradient optimization , 1998 .

[21]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[22]  Torbjörn Larsson,et al.  Side constrained traffic equilibrium models: analysis, computation and applications , 1999 .

[23]  Paul Tseng,et al.  An ε-relaxation method for separable convex cost generalized network flow problems , 2000, Math. Program..

[24]  Paul Tseng,et al.  An epsilon-out-of-Kilter Method for Monotropic Programming , 2001, Math. Oper. Res..

[25]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[26]  Jean Charles Gilbert,et al.  Numerical Optimization: Theoretical and Practical Aspects , 2003 .

[27]  D. Bertsekas.  Extended Monotropic Programming and Duality , 2008 .

[28]  Dimitri P. Bertsekas,et al.  Convex Optimization Theory , 2009 .

[29]  Panos M. Pardalos,et al.  Convex optimization theory , 2010, Optim. Methods Softw..