Paraboloid-Ellipsoid Programming Problem
Abstract
Keywords
References
http://en.wikipedia.org/Newton’s method
http://en.wikipedia.org/Linear programming
http://en.wikipedia.org/Quadratic programming
Kozlov, M.K.; Tarasov, S.P.; Khachiyan, L.G. "Polynomial solvability of convex quadratic programming," in Sov. Math., Dokl. 20, 1108-1111 (1979). This is a translation from Dokl. Akad. Nauk SSSR 248, 1049-1051 (1979). ISSN: 0197-6788.
Sahni, S. "Computationally related problems," in SIAM Journal on Computing, 3, 262--279, 1974.
Michael R. Garey and David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. ISBN 0-7167-1045-5. A6: MP2, pg.245.
Panos M. Pardalos and Stephen A., Quadratic programming with one negative eigenvalue is NP-hard, Vavasis in Journal of Global Optimization, Volume 1, Number 1, 1991, pg.15-22.
Allemand, K. (Doctoral thesis 2496, 'Optimisation quadratique en variables binaires : heuristiques et cas polynomiaux'), Swiss Federal Institute of Technology, www.epfl.ch
Stephen Boyd and Lieven Vandenberghe, Convex Optimization (book in pdf)
Lockwood, E. H. "The Parabola." Ch. 1 in A Book of Curves. Cambridge, England: Cambridge University Press, pp. 2-12, 1967.
Loomis, E. S. "The Parabola." §2.5 in The Pythagorean Proposition: Its Demonstrations Analyzed and Classified and Bibliography of Sources for Data of the Four Kinds of "Proofs," 2nd ed. Reston, VA: National Council of Teachers of Mathematics, pp. 25-28, 1968.
Ralph, P. A., “Calculus : Analytic Geometry and Calculus, with Vector”, New York, USA, McGraw-Hill, 1962.
Refbacks
- There are currently no refbacks.
International Conference on Engineering and Technology Development (ICETD)
Bandar Lampung University
ISSN: 2301-5690