Volume 76,
1996
- Michael J. Todd:
Potential-reduction methods in mathematical programming.
3-45 BibTeX
- Yurii Nesterov:
Long-step strategies in interior-point primal-dual methods.
47-94 BibTeX
- Clovis C. Gonzaga, J. Frédéric Bonnans:
Fast convergence of the simplified largest step path following algorithm.
95-115 BibTeX
- Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye:
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
117-130 BibTeX
- Jean-Louis Goffin, Jacek Gondzio, Robert Sarkissian, Jean-Philippe Vial:
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method.
131-154 BibTeX
- Kenneth O. Kortanek, Xiaojie Xu, Yinyu Ye:
An infeasible interior-point algorithm for solving primal and dual geometric programs.
155-181 BibTeX
- Roland W. Freund, Florian Jarre:
A QMR-based interior-point algorithm for solving linear programs.
183-210 BibTeX
- Yinyu Ye:
On homogeneous and self-dual algorithms for LCP.
211-221 BibTeX
- Florian A. Potra, Rongqin Sheng:
Predictor-corrector algorithm for solving P*(k)-matrix LCP from arbitrary positive starting points.
223-244 BibTeX
- Kurt M. Anstreicher:
Volumetric path following algorithms for linear programming.
245-263 BibTeX
- Roman A. Polyak, Marc Teboulle:
Nonlinear rescaling and proximal-like methods in convex optimization.
265-284 BibTeX
- Wilfred Kaplan, Wei H. Yang:
Duality theorem for a generalized Fermat-Weber problem.
285-297 BibTeX
- Satoru Iwata:
A capacity scaling algorithm for convex cost submodular flows.
299-308 BibTeX
- Clovis C. Gonzaga:
The largest step path following algorithm for monotone linear complementarity problems.
309-332 BibTeX
- Kyriakos Kilakos, O. Marotte:
Fractional and integral colourings.
333-347 BibTeX
- Yuri M. Ermoliev, Arkadii V. Kryazhimskii, Andrzej Ruszczynski:
Constraint aggregation principle in convex optimization.
353-372 BibTeX
- Evgeni A. Nurminski:
Separating plane algorithms for convex optimization.
373-391 BibTeX
- Claude Lemaréchal, Claudia A. Sagastizábal:
Variable metric bundle methods: From conceptual to implementable forms.
393-410 BibTeX
- Liqun Qi, Xiaojun Chen:
A preconditioning proximal Newton method for nondifferentiable convex optimization.
411-429 BibTeX
- José Mario Martínez, Antonio Carlos Moretti:
A trust region method for minimization of nonsmooth functions with linear constraints.
431-449 BibTeX
- J. Sun:
On piecewise quadratic Newton and trust region problems.
451-467 BibTeX
- Nobuo Yamashita, Masao Fukushima:
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems.
469-491 BibTeX
- Francisco Facchinei, Christian Kanzow:
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems.
493-512 BibTeX
- Andreas Fischer:
Solution of monotone complementarity problems with locally Lipschitzian functions.
513-532 BibTeX
- Stephen C. Billups, Michael C. Ferris:
QPCOMP: A quadratic programming based solver for mixed complementarity problems.
533-562 BibTeX
- Hichem Sellami, Stephen M. Robinson:
Implementation of a continuation method for normal maps.
563-578 BibTeX
- Bernd Kummer:
Parametrizations of Kojima's system and relations to penalty and barrier functions.
579-592 BibTeX
- Daniel Ralph, Stefan Scholtes:
Sensitivity analysis of composite piecewise smooth equations.
593-612 BibTeX
Copyright © Sun May 17 00:14:04 2009
by Michael Ley (ley@uni-trier.de)
