default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 88
Volume 88, Number 1, June 2000
- Thomas F. Coleman, Yuying Li:
A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints. 1-31 - László Lipták, László Lovász:
Facets with fixed defect of the stable set polytope. 33-44 - Alfred Auslender:
Existence of optimal solutions and duality results under weak conditions. 45-59 - Renato D. C. Monteiro, Takashi Tsuchiya:
Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. 61-83 - Paul Tseng, Dimitri P. Bertsekas:
An ε-relaxation method for separable convex cost generalized network flow problems. 85-104 - Anders Forsgren:
Optimality conditions for nonconvex semidefinite programming. 105-128 - Satoru Fujishige, Kazuo Murota:
Notes on L-/M-convex functions and the separation theorems. 129-146 - Reinhard John:
A first order characterization of generalized monotonicity. 147-155 - James V. Burke, Maijian Qian:
On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating. 157-181 - Paul Tseng:
Co-NP-completeness of some matrix classification problems. 183-192 - Masayuki Shida:
Change of generalized indices of stationary solutions. to multiparametric optimization. 193-210 - Bintong Chen, Xiaojun Chen
, Christian Kanzow:
A penalized Fischer-Burmeister NCP-function. 211-216 - Satoru Fujishige:
A note on Faigle and Kern's dual greedy polyhedra. 217-220
Volume 88, Number 2, August 2000
- Martin Bartelt, Wu Li:
Exact order of Hoffman's error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation. 223-253 - Martin Gugat:
Error bounds for infinite systems of convex inequalities without Slater's condition. 255-275 - Hui Hu:
Perturbation analysis of global error bounds for systems of linear inequalities. 277-284 - Diethard Klatte:
Upper Lipschitz behavior of solutions to perturbed. C1, 1 programs. 285-311 - Bernd Kummer:
Inverse functions of pseudo regular mappings and regularity conditions. 313-339 - Zhi-Quan Luo:
New error bounds and their applications to convergence analysis of iterative algorithms. 341-355 - Kung Fu Ng, Xi Yin Zheng:
Global error bounds with fractional exponents. 357-370 - Mikhail V. Solodov, Benar Fux Svaiter:
Error bounds for proximal point subproblems and associated inexact proximal point algorithms. 371-389 - Jianzhong Zhang, Naihua Xiu:
Global s -type error bound for the extended linear complementarity problem and applications. 391-410
Volume 88, Number 3, September 2000
- Aharon Ben-Tal, Arkadi Nemirovski:
Robust solutions of Linear Programming problems contaminated with uncertain data. 411-424 - Ralf Borndörfer, Robert Weismantel:
Set packing relaxations of some integer programs. 425-450 - Marina A. Epelman, Robert M. Freund:
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. 451-485 - Michael C. Ferris, Todd S. Munson:
Modeling languages and Condor: metacomputing for optimization. 487-505 - Hiroshi Nagamochi, Toshihide Ibaraki:
A fast algorithm for computing minimum 3-way and 4-way cuts. 507-520 - Jean-Pierre Crouzeix, Patrice Marcotte, Daoli Zhu:
Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities. 521-539 - Jeroen Kuipers, Tamás Solymosi, Harry Aarts:
Computing the nucleolus of some combinatorially-structured games. 541-563 - Andreas Wächter, Lorenz T. Biegler:
Failure of global convergence for a class of interior point methods for nonlinear programming. 565-574 - M. Seetharama Gowda, Yoon J. Song:
On semidefinite linear complementarity problems. 575-587
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 2024-09-28 01:30 CEST 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:
