The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization

We study subgradient methods for convex optimization that use projections onto successive approximations of level sets of the objective corresponding to estimates of the optimal value. We establish convergence and efficiency estimates for simple ballstep level controls without requiring that the feasible set be compact. Our framework may handle accelerations based on "cheap" projections, surrogate constraints, and conjugate subgradient techniques.

[1]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[2]  Yu. M. Ermol’ev.  Methods of solution of nonlinear extremal problems , 1966 .

[3]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[4]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[5]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[6]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[7]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[8]  H. Sherali,et al.  On the choice of step size in subgradient optimization , 1981 .

[9]  J. Goffin.  CONVERGENCE RESULTS IN A CLASS OF VARIABLE METRIC SUBGRADIENT METHODS , 1981 .

[10]  R. Jonker,et al.  A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[11]  Zvi Drezner.  Technical Note - The Nested Ball Principle for the Relaxation Method , 1983, Oper. Res..

[12]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[13]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[14]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[15]  Michel Minoux,et al.  Mathematical Programming , 1986 .

[16]  Jeffery L. Kennington,et al.  A generalization of Polyak's convergence result for subgradient optimization , 1987, Math. Program..

[17]  H. Sherali,et al.  A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems , 1989 .

[18]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[19]  A. Kulikov,et al.  Convex optimization with prescribed accuracy , 1990 .

[20]  Sehun Kim,et al.  Variable target value subgradient method , 1991, Math. Program..

[21]  M. B. Shchepakin.  An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence , 1992 .

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

[23]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[24]  Andrzej Cegielski,et al.  Projection onto an acute cone and convex feasibility problem , 1993, System Modelling and Optimization.

[25]  Sehun Kim,et al.  An improved subgradient method for constrained nondifferentiable optimization , 1993, Oper. Res. Lett..

[26]  K. Kiwiel.  A Cholesky dual method for proximal piecewise linear programming , 1994 .

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

[28]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[29]  K. Kiwiel.  Finding normal solutions in piecewise linear programming , 1995 .

[30]  K. Kiwiel.  Block-iterative surrogate projection methods for convex feasibility problems , 1995 .

[31]  Per Olov Lindberg,et al.  A descent proximal level bundle method for convex nondifferentiable optimization , 1995, Oper. Res. Lett..

[32]  Krzysztof C. Kiwiel,et al.  Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities , 1995, Math. Program..

[33]  K. Kiwiel.  The Efficiency of Subgradient Projection Methods for Convex Optimization , 1996 .

[34]  K. Kiwiel.  The efficiency of subgradient projection methods for convex optimization, part I: general level methods , 1996 .

[35]  David S. Johnson,et al.  Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.

[36]  A. J. Jones,et al.  Estimating the Held-Karp lower bound for the geometric TSP , 1997 .

[37]  K. Kiwiel.  Monotone gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems , 1997 .

[38]  Jean-Louis Goffin,et al.  Convergence of a simple subgradient level method , 1999, Math. Program..