default search action
Search dblp for Publications
export results for "toc:db/journals/anor/anor62.bht:"
@article{DBLP:journals/anor/0001B96, author = {John E. Mitchell and Brian Borchers}, title = {Solving real-world linear ordering problems using a primal-dual interior point cutting plane method}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {253--276}, year = {1996}, url = {https://doi.org/10.1007/BF02206819}, doi = {10.1007/BF02206819}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/0001B96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Anstreicher96, author = {Kurt M. Anstreicher}, title = {Large step volumetric potential reduction algorithms for linear programming}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {521--538}, year = {1996}, url = {https://doi.org/10.1007/BF02206828}, doi = {10.1007/BF02206828}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Anstreicher96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/AnstreicherF96, author = {Kurt M. Anstreicher and Robert M. Freund}, title = {Preface}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, year = {1996}, url = {https://doi.org/10.1007/BF02206808}, doi = {10.1007/BF02206808}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/AnstreicherF96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/BoggsDR96, author = {Paul T. Boggs and Paul D. Domich and Janet E. Rogers}, title = {An interior point method for general large-scale quadratic programming problems}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {419--437}, year = {1996}, url = {https://doi.org/10.1007/BF02206825}, doi = {10.1007/BF02206825}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/BoggsDR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/BreitfeldS96, author = {Marc G. Breitfeld and David F. Shanno}, title = {Computational experience with penalty-barrier methods for nonlinear programming}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {439--463}, year = {1996}, url = {https://doi.org/10.1007/BF02206826}, doi = {10.1007/BF02206826}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/BreitfeldS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Freund96, author = {Robert M. Freund}, title = {An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {29--57}, year = {1996}, url = {https://doi.org/10.1007/BF02206810}, doi = {10.1007/BF02206810}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Freund96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/HwangLLF96, author = {Tsung{-}Min Hwang and Chih{-}Hung Lin and Wen{-}Wei Lin and Shu{-}Cherng Fang}, title = {A relaxed primal-dual path-following algorithm for linear programming}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {173--196}, year = {1996}, url = {https://doi.org/10.1007/BF02206816}, doi = {10.1007/BF02206816}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/HwangLLF96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/JansenRTV96, author = {Benjamin Jansen and Cornelis Roos and Tam{\'{a}}s Terlaky and Jean{-}Philippe Vial}, title = {Primal-dual target-following algorithms for linear programming}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {197--231}, year = {1996}, url = {https://doi.org/10.1007/BF02206817}, doi = {10.1007/BF02206817}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/JansenRTV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Kojima96, author = {Masakazu Kojima}, title = {Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {1--28}, year = {1996}, url = {https://doi.org/10.1007/BF02206809}, doi = {10.1007/BF02206809}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Kojima96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/MelmanP96, author = {Aaron Melman and R. Polyak}, title = {The Newton modified barrier method for {QP} problems}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {465--519}, year = {1996}, url = {https://doi.org/10.1007/BF02206827}, doi = {10.1007/BF02206827}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/MelmanP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/MizunoJ96, author = {Shinji Mizuno and Florian Jarre}, title = {An infeasible-interior-point algorithm using projections onto a convex set}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {59--80}, year = {1996}, url = {https://doi.org/10.1007/BF02206811}, doi = {10.1007/BF02206811}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/MizunoJ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/MuramatsuT96, author = {Masakazu Muramatsu and Takashi Tsuchiya}, title = {An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {325--355}, year = {1996}, url = {https://doi.org/10.1007/BF02206822}, doi = {10.1007/BF02206822}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/MuramatsuT96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Potra96, author = {Florian A. Potra}, title = {An\emph{O(nL)} infeasible-interior-point algorithm for {LCP} with quadratic convergence}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {81--102}, year = {1996}, url = {https://doi.org/10.1007/BF02206812}, doi = {10.1007/BF02206812}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Potra96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Saigal96, author = {Romesh Saigal}, title = {A simple proof of a primal affine scaling method}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {303--324}, year = {1996}, url = {https://doi.org/10.1007/BF02206821}, doi = {10.1007/BF02206821}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Saigal96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Saigal96a, author = {Romesh Saigal}, title = {The primal power affine scaling method}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {375--417}, year = {1996}, url = {https://doi.org/10.1007/BF02206824}, doi = {10.1007/BF02206824}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Saigal96a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Schattler96, author = {Ulrich Sch{\"{a}}ttler}, title = {An interior-point method for semi-infinite programming problems}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {277--301}, year = {1996}, url = {https://doi.org/10.1007/BF02206820}, doi = {10.1007/BF02206820}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Schattler96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/SturmZ96, author = {Jos F. Sturm and Shuzhong Zhang}, title = {New complexity results for the Iri-Imai method}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {539--564}, year = {1996}, url = {https://doi.org/10.1007/BF02206829}, doi = {10.1007/BF02206829}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/SturmZ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Sun96, author = {Jie Sun}, title = {A convergence analysis for a convex version of Dikin's algorithm}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {357--374}, year = {1996}, url = {https://doi.org/10.1007/BF02206823}, doi = {10.1007/BF02206823}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Sun96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/ToddY96, author = {Michael J. Todd and Yinyu Ye}, title = {A lower bound on the number of iterations of long-step primal-dual linear programming algorithms}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {233--252}, year = {1996}, url = {https://doi.org/10.1007/BF02206818}, doi = {10.1007/BF02206818}, timestamp = {Fri, 08 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/ToddY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/VavasisY96, author = {Stephen A. Vavasis and Yinyu Ye}, title = {Identifying an optimal basis in linear programming}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {565--572}, year = {1996}, url = {https://doi.org/10.1007/BF02206830}, doi = {10.1007/BF02206830}, timestamp = {Fri, 08 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/VavasisY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Wright96, author = {Stephen J. Wright}, title = {A path-following interior-point algorithm for linear and quadratic problems}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {103--130}, year = {1996}, url = {https://doi.org/10.1007/BF02206813}, doi = {10.1007/BF02206813}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/anor/Wright96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/XuHY96, author = {Xiaojie Xu and Pi{-}Fang Hung and Yinyu Ye}, title = {A simplified homogeneous and self-dual linear programming algorithm and its implementation}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {151--171}, year = {1996}, url = {https://doi.org/10.1007/BF02206815}, doi = {10.1007/BF02206815}, timestamp = {Fri, 08 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/XuHY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/ZhangZ96, author = {Detong Zhang and Yin Zhang}, title = {A Mehrotra-type predictor-corrector algorithm with polynomiality and\emph{Q}-subquadratic convergence}, journal = {Ann. Oper. Res.}, volume = {62}, number = {1}, pages = {131--150}, year = {1996}, url = {https://doi.org/10.1007/BF02206814}, doi = {10.1007/BF02206814}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/ZhangZ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.