Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 62
Volume 62, Number 1, 1996
- Kurt M. Anstreicher, Robert M. Freund:
Preface. - Masakazu Kojima:
Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs. 1-28 - Robert M. Freund:
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution. 29-57 - Shinji Mizuno, Florian Jarre:
An infeasible-interior-point algorithm using projections onto a convex set. 59-80 - Florian A. Potra:
AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence. 81-102 - Stephen J. Wright:
A path-following interior-point algorithm for linear and quadratic problems. 103-130 - Detong Zhang, Yin Zhang:
A Mehrotra-type predictor-corrector algorithm with polynomiality andQ-subquadratic convergence. 131-150 - Xiaojie Xu, Pi-Fang Hung, Yinyu Ye:
A simplified homogeneous and self-dual linear programming algorithm and its implementation. 151-171 - Tsung-Min Hwang, Chih-Hung Lin, Wen-Wei Lin, Shu-Cherng Fang:
A relaxed primal-dual path-following algorithm for linear programming. 173-196 - Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Primal-dual target-following algorithms for linear programming. 197-231 - Michael J. Todd, Yinyu Ye:
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms. 233-252 - John E. Mitchell, Brian Borchers
:
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method. 253-276 - Ulrich Schättler:
An interior-point method for semi-infinite programming problems. 277-301 - Romesh Saigal:
A simple proof of a primal affine scaling method. 303-324 - Masakazu Muramatsu, Takashi Tsuchiya:
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption. 325-355 - Jie Sun:
A convergence analysis for a convex version of Dikin's algorithm. 357-374 - Romesh Saigal:
The primal power affine scaling method. 375-417 - Paul T. Boggs, Paul D. Domich, Janet E. Rogers:
An interior point method for general large-scale quadratic programming problems. 419-437 - Marc G. Breitfeld, David F. Shanno:
Computational experience with penalty-barrier methods for nonlinear programming. 439-463 - Aaron Melman, R. Polyak:
The Newton modified barrier method for QP problems. 465-519 - Kurt M. Anstreicher:
Large step volumetric potential reduction algorithms for linear programming. 521-538 - Jos F. Sturm, Shuzhong Zhang:
New complexity results for the Iri-Imai method. 539-564 - Stephen A. Vavasis, Yinyu Ye:
Identifying an optimal basis in linear programming. 565-572
a service of 
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-04-18 20:20 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:
