Mathematical Programming, Volume 95
Volume 95, Number 1, January 2003
- Marko Loparic, Hugues Marchand, Laurence A. Wolsey: Dynamic knapsack sets and capacitated lot-sizing. 53-69
- Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh: A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. 71-90
- Michael Ulbrich, Stefan Ulbrich: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function. 103-135
- Stephen J. Wright: Constraint identification and algorithm stabilization for degenerate nonlinear programs. 137-160
- Dexuan Xie, Suresh B. Singh, Eugene M. Fluder: Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases. 161-185
Volume 95, Number 2, February 2003
- Reha H. Tütüncü, K. C. Toh, Michael J. Todd: Solving semidefinite-quadratic-linear programs using SDPT3. 189-217
- Jos F. Sturm: Avoiding numerical cancellation in the interior point method for solving semidefinite programs. 219-247
- Erling D. Andersen, Cornelis Roos, Tamás Terlaky: On implementing a primal-dual interior-point method for conic quadratic optimization. 249-277
- Hande Y. Benson, Robert J. Vanderbei: Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming. 279-302
- Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda: Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. 303-327
- Samuel Burer, Renato D. C. Monteiro: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. 329-357
- Samuel Burer, Renato D. C. Monteiro, Yin Zhang: A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. 359-379
- Christoph Helmberg: Numerical evaluation of SBmethod. 381-406
- Hans D. Mittelmann: An independent benchmarking of SDP and SOCP solvers. 407-430
Volume 95, Number 3, March 2003
- Xin Chen, Paul Tseng: Non-Interior continuation methods for solving semidefinite complementarity problems. 431-474
- Jitka Dupacová, Nicole Gröwe-Kuska, Werner Römisch: Scenario reduction in stochastic programming. 493-511
- T. E. S. Raghavan, Zamir Syed: A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information. 513-532
- Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. 533-554
- Javier M. Moguerza, Francisco J. Prieto: An augmented Lagrangian interior-point method using directions of negative curvature. 573-616
- Klaus Jansen, Lorant Porkolab: Computing optimal preemptive schedules for parallel tasks: linear programming approaches. 617-630
- Alexey F. Izmailov, Mikhail V. Solodov: Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods. 631-650
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team