default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 76
Volume 76, 1996
- Michael J. Todd:
Potential-reduction methods in mathematical programming. 3-45 - Yurii E. Nesterov:
Long-step strategies in interior-point primal-dual methods. 47-94 - Clóvis C. Gonzaga, J. Frédéric Bonnans:
Fast convergence of the simplified largest step path following algorithm. 95-115 - Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye:
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. 117-130 - Jean-Louis Goffin, Jacek Gondzio
, Robert Sarkissian, Jean-Philippe Vial:
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. 131-154 - Kenneth O. Kortanek, Xiaojie Xu, Yinyu Ye:
An infeasible interior-point algorithm for solving primal and dual geometric programs. 155-181 - Roland W. Freund, Florian Jarre:
A QMR-based interior-point algorithm for solving linear programs. 183-210 - Yinyu Ye:
On homogeneous and self-dual algorithms for LCP. 211-221 - Florian A. Potra, Rongqin Sheng:
Predictor-corrector algorithm for solving P*(k)-matrix LCP from arbitrary positive starting points. 223-244 - Kurt M. Anstreicher:
Volumetric path following algorithms for linear programming. 245-263 - Roman A. Polyak, Marc Teboulle:
Nonlinear rescaling and proximal-like methods in convex optimization. 265-284 - Wilfred Kaplan, Wei H. Yang:
Duality theorem for a generalized Fermat-Weber problem. 285-297 - Satoru Iwata:
A capacity scaling algorithm for convex cost submodular flows. 299-308 - Clóvis C. Gonzaga:
The largest step path following algorithm for monotone linear complementarity problems. 309-332 - Kyriakos Kilakos, Odile Marotte:
Fractional and integral colourings. 333-347 - Yuri M. Ermoliev, Arkadii V. Kryazhimskii, Andrzej Ruszczynski:
Constraint aggregation principle in convex optimization. 353-372 - Evgeni A. Nurminski:
Separating plane algorithms for convex optimization. 373-391 - Claude Lemaréchal, Claudia A. Sagastizábal:
Variable metric bundle methods: From conceptual to implementable forms. 393-410 - Liqun Qi, Xiaojun Chen:
A preconditioning proximal Newton method for nondifferentiable convex optimization. 411-429 - José Mario Martínez, Antônio Carlos Moretti:
A trust region method for minimization of nonsmooth functions with linear constraints. 431-449 - Jie Sun:
On piecewise quadratic Newton and trust region problems. 451-467 - Nobuo Yamashita, Masao Fukushima:
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. 469-491 - Francisco Facchinei, Christian Kanzow:
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. 493-512 - Andreas Fischer:
Solution of monotone complementarity problems with locally Lipschitzian functions. 513-532 - Stephen C. Billups, Michael C. Ferris:
QPCOMP: A quadratic programming based solver for mixed complementarity problems. 533-562 - Hichem Sellami, Stephen M. Robinson:
Implementation of a continuation method for normal maps. 563-578 - Bernd Kummer:
Parametrizations of Kojima's system and relations to penalty and barrier functions. 579-592 - Daniel Ralph, Stefan Scholtes:
Sensitivity analysis of composite piecewise smooth equations. 593-612
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-23 00:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
