default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 67
Volume 67, 1994
- Zhi-Quan Luo, Jong-Shi Pang:
Error bounds for analytic systems and their applications. 1-28 - Stephen J. Wright:
An infeasible-interior-point algorithm for linear complementarity problems. 29-51 - Ciyou Zhu:
Solving large-scale minimax problems with the primal-dual steepest descent algorithm. 53-76 - M. van Rooyen, X. Zhou, Sanjo Zlobec:
A saddle-point characterization of Pareto optima. 77-88 - Andrew R. Conn, Nicholas I. M. Gould
, Philippe L. Toint:
A note on exploiting structure when using slack variables. 89-97 - Alexander Shapiro:
Quantitative stability in stochastic programming. 99-108 - Shinji Mizuno:
Polynomiality of infeasible-interior-point algorithms for linear programming. 109-119 - Kalyan T. Talluri, Donald K. Wagner:
On the k-cut subgraph polytope. 121-132 - Faruk Güder, James G. Morris:
Optimal objective function approximation for separable convex quadratic programming. 133-142 - Julia L. Higle, Suvrajeet Sen:
Finite master programs in regularized stochastic decomposition. 143-168 - Roberto Cominetti, Jaime San Martín:
Asymptotic analysis of the exponential penalty trajectory in linear programming. 169-187 - Thomas F. Coleman, Yuying Li:
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. 189-224 - Jean-Paul Penot:
Optimality conditions in mathematical programming and composite optimization. 225-245 - T. Bannert:
A trust region algorithm for nonsmooth optimization. 247-264 - Margaret H. Wright:
Some properties of the Hessian of the logarithmic barrier function. 265-295 - Yves Pochet, Laurence A. Wolsey:
Polyhedra for lot-sizing with Wagner-Whitin costs. 297-323 - Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki:
Implementing an efficient minimum capacity cut algorithm. 325-341 - J. Randall Brown:
Bounded knapsack sharing. 343-382 - Florian A. Potra:
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. 383-406 - Roland W. Freund, Florian Jarre:
An interior-point method for fractional programs with convex constraints. 407-440
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-05-15 21:25 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:
