Randomized algorithms for the separation of point sets and for solving quadratic programs-Reference-Cited by-同舟云学术

Randomized algorithms for the separation of point sets and for solving quadratic programs

Published:1995-09 Issue:2 Volume:32 Page:195-210
ISSN:0095-4616
Container-title:Applied Mathematics & Optimization
language:en
Short-container-title:Appl Math Optim

Author:

Botkin N. D.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF01185230.pdf

Reference9 articles.

1. Gärtner B (1993) A subexponential algorithm for abstract optimization problems. Technical Report B93-05, Department of Mathematics, Free University, Berlin

2. Goldbach R (1992) Inkugel and Umkugel konvexer Polyeder. Diplomarbeit, Institut für Angewandte Mathematik and Statistik, Julius-Maximilians-Universität, Würzburg

3. Goldfarb D, Idnani A (1983) A numerically stable dual algorithm for solving strictly convex quadratic programs. Math Programming 27:103?131

4. Kalai G (1992) A subexponential randomized simplex algorithm. Proc. 24th ACM Symposium on Theory of Computing, pp 475?482

5. Matousek J, Sharir M, Welzl E (1992) A subexponential bound for linear programming. Technical Report B92-17, Department of Mathematics, Free University, Berlin

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generation of Dangerous Disturbances for Flight Systems;Dynamic Games and Applications;2018-04-18

2. References;Real-Time Collision Detection;2005

3. Separation by Hyperplanes: A Linear Semi-Infinite Programming Approach;Nonconvex Optimization and Its Applications;2001

4. Some Randomized Algorithms for Convex Quadratic Programming;Applied Mathematics and Optimization;1999-01-02