Mathematical Programming, Volume 104

Volume 104, Number 1, September 2005

• Suvrajeet Sen, Julia L. Higle:
  The C³ Theorem and a D² Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification. 1-20
  Electronic Edition (link) BibTeX
• Carlo Filippi, Alessandro Agnetis:
  An asymptotically exact algorithm for the high-multiplicity bin packing problem. 21-37
  Electronic Edition (link) BibTeX
• Alfred Auslender, Marc Teboulle:
  Interior projection-like methods for monotone variational inequalities. 39-68
  Electronic Edition (link) BibTeX
• Xi Yin Zheng, Kung Fu Ng:
  The Fermat rule for multifunctions on Banach spaces. 69-90
  Electronic Edition (link) BibTeX
• Matteo Fischetti, Fred Glover, Andrea Lodi:
  The feasibility pump. 91-104
  Electronic Edition (link) BibTeX
• Aris Daniilidis, Claude Lemaréchal:
  On a primal-proximal heuristic in discrete optimization. 105-128
  Electronic Edition (link) BibTeX
• Louis Dubost, Robert Gonzalez, Claude Lemaréchal:
  A primal-proximal heuristic applied to the French Unit-commitment problem. 129-151
  Electronic Edition (link) BibTeX
• Arjan Berkelaar, Joaquim A. S. Gromicho, Roy Kouwenberg, Shuzhong Zhang:
  A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming. 153-177
  Electronic Edition (link) BibTeX
• M. T. Çezik, Garud Iyengar:
  Cuts for mixed 0-1 conic programming. 179-202
  Electronic Edition (link) BibTeX

Volume 104, Number 2-3, November 2005

• Roger J.-B. Wets:
  Foreword: Special Issue on Variational Analysis, Optimization, and their Applications. 203-204
  Electronic Edition (link) BibTeX
• J. Frédéric Bonnans, Héctor Ramírez Cabrera:
  Perturbation analysis of second-order cone programming problems. 205-227
  Electronic Edition (link) BibTeX
• Regina Sandra Burachik, Vaithilingam Jeyakumar:
  A new geometric condition for Fenchel's duality in infinite dimensional spaces. 229-233
  Electronic Edition (link) BibTeX
• James V. Burke, Sien Deng:
  Weak sharp minima revisited, part II: application to linear regularity and error bounds. 235-261
  Electronic Edition (link) BibTeX
• James V. Burke, Adrian S. Lewis, Michael L. Overton:
  Variational analysis of functions of the roots of polynomials. 263-292
  Electronic Edition (link) BibTeX
• Jein-Shan Chen, Paul Tseng:
  An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. 293-327
  Electronic Edition (link) BibTeX
• María J. Cánovas, Asen L. Dontchev, Marco A. López, Juan Parra:
  Metric regularity of semi-infinite constraint systems. 329-346
  Electronic Edition (link) BibTeX
• J. F. Edmond, Lionel Thibault:
  Relaxation of an optimal control problem involving a perturbed sweeping process. 347-373
  Electronic Edition (link) BibTeX
• Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi:
  New approaches for optimizing over the semimetric polytope. 375-388
  Electronic Edition (link) BibTeX
• Ivan Ginchev, Angelo Guerraggio, Matteo Rocca:
  Second-order conditions in C^{1, 1} constrained vector optimization. 389-405
  Electronic Edition (link) BibTeX
• J. E. Harrington, Benjamin F. Hobbs, Jong-Shi Pang, A. Liu, G. Roch:
  Collusive game solutions via optimization. 407-435
  Electronic Edition (link) BibTeX
• René Henrion, Jirí V. Outrata:
  Calmness of constraint systems with applications. 437-464
  Electronic Edition (link) BibTeX
• Huynh van Ngai, Michel Théra:
  Error bounds for convex differentiable inequality systems in Banach spaces. 465-482
  Electronic Edition (link) BibTeX
• A. D. Ioffe, R. E. Lucchetti:
  Typical convex program is very well posed. 483-499
  Electronic Edition (link) BibTeX
• Alfredo N. Iusem, Alberto Seeger:
  On pairs of vectors achieving the maximal angle of a convex cone. 501-523
  Electronic Edition (link) BibTeX
• A. Jourani, J. J. Ye:
  Error Bounds for Eigenvalue and Semidefinite Matrix Inequality Systems. 525-540
  Electronic Edition (link) BibTeX
• Hans-Jakob Lüthi, Jörg Doege:
  Convex risk measures for portfolio optimization and concepts of flexibility. 541-559
  Electronic Edition (link) BibTeX
• Fanwen Meng, Defeng Sun, Gongyun Zhao:
  Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. 561-581
  Electronic Edition (link) BibTeX
• Robert Mifflin, Claudia A. Sagastizábal:
  A VU-algorithm for convex minimization. 583-608
  Electronic Edition (link) BibTeX
• Scott A. Miller, Jérôme Malick:
  Newton methods for nonsmooth convex minimization: connections among U-Lagrangian, Riemannian Newton and SQP methods. 609-633
  Electronic Edition (link) BibTeX
• Boris S. Mordukhovich, Nguyen Mau Nam:
  Subgradient of distance functions with applications to Lipschitzian stability. 635-668
  Electronic Edition (link) BibTeX
• Yu. Nesterov:
  Lexicographic differentiation of nonsmooth functions. 669-700
  Electronic Edition (link) BibTeX
• Dominikus Noll, Pierre Apkarian:
  Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods. 701-727
  Electronic Edition (link) BibTeX
• Dominikus Noll, Pierre Apkarian:
  Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods. 729-747
  Electronic Edition (link) BibTeX
• Xudong Yao, Jianxin Zhou:
  A local minimax characterization for computing multiple nonsmooth saddle critical points. 749-760
  Electronic Edition (link) BibTeX