Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 3166–3170Cite as

Quadratic Programming over an Ellipsoid

  • Reference work entry

Article Outline

Keywords

See also

References

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Celis MR, Dennis JE, Tapia RA (1984) A trust region strategy for nonlinear equality constrained optimization. In: Boggs PT Byrd R, Schnable R (ed) Numerical Optimization. SIAM, Philadelphia, pp 71–82

    Google Scholar 

  2. Dennis JE Jr, Schnable RE (1983) Numerical methods for unconstrained optimization and nonlinear equations. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  3. Fu M, Luo Z-Q, Ye Y (1996) Approximation algorithms for quadratic programming. J Combin Optim (to appear)

    Google Scholar 

  4. Gay DM (1981) Computing optimal locally constrained steps. SIAM J Sci Statist Comput 2:186–197

    Article  MATH  MathSciNet  Google Scholar 

  5. Gibbons LE, Hearn DW, Pardalos PM (1996) A continuous based heuristic for the maximum clique problem. In: DIMACS. Amer. Math. Soc., Providence, pp 103–124

    Google Scholar 

  6. Kamath AP, Karmarkar NK, Ramakrishnan KG, Resende MGC (1992) A continuous approach to inductive inference. Math Program 57:215–238

    Article  MATH  MathSciNet  Google Scholar 

  7. Levenberg K (1963) A method for the solution of certain non-linear problems in least squares. Quart Appl Math 2:164–168

    MathSciNet  Google Scholar 

  8. Marquardt DW (1963) An algorithm for least-squares estimation of nonlinear parameters. J SIAM 11:431–441

    MATH  MathSciNet  Google Scholar 

  9. Martinez JM (1994) Local minimizers of quadratic functions on Euclidean balls and spheres. SIAM J Optim 4:159–176

    Article  MATH  MathSciNet  Google Scholar 

  10. Moré JJ (1977) The Levenberg-Marquardt algorithm: Implementation and theory. In: Watson GA (ed) Numerical Analysis. Springer, Berlin

    Google Scholar 

  11. Nesterov YuE, Nemirovskii AS (1993) Interior point polynomial methods in convex programming: Theory and algorithms. SIAM, Philadelphia

    Google Scholar 

  12. Pardalos PM, Rosen JB (1987) Constrained global optimization: Algorithms and applications. Lecture Notes Computer Sci, vol 268. Springer, Berlin

    MATH  Google Scholar 

  13. Powell MJD, Yuan Y (1991) A trust region algorithm for equality constrained optimization. Math Program 49:189–211

    Article  MathSciNet  Google Scholar 

  14. Rendl F, Wolkowicz H (1994) A semidefinite framework for trust region subproblems with applications to large scale minimization. CORR Report 94-32, Dept Combinatorics and Optim, Univ Waterloo, Ontario

    Google Scholar 

  15. Sorenson DC (1982) Newton's method with a model trust region modification. SIAM J Numer Anal 19:409–426

    Article  MathSciNet  Google Scholar 

  16. Vavasis SA (1991) Nonlinear optimization: Complexity issues. Oxford Sci. Publ., Oxford

    MATH  Google Scholar 

  17. Vavasis SA (1993) Polynomial time weak approximation algorithms for quadratic programming. In: Pardalos PM (ed) Complexity in Numerical Optimization. World Sci., Singapore

    Google Scholar 

  18. Vavasis SA, Zippel R (1990) Proving polynomial time for sphere-constrained quadratic programming. Techn Report 90–1182, Dept Computer Sci, Cornell Univ, Ithaca, NY

    Google Scholar 

  19. Ye Y (1992) On affine scaling algorithms for nonconvex quadratic programming. Math Program 56:285–300

    Article  Google Scholar 

  20. Ye Y (1994) Combining binary search and Newton's method to compute real roots for a class of real functions. J Complexity 10:271–280

    Article  MATH  MathSciNet  Google Scholar 

  21. Yuan Y (1990) On a subproblem of trust region algorithms for constrained optimization. Math Program 47:53–63

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Management Sci., University Iowa, Iowa City, USA

    Yinyu Ye

Authors
  1. Yinyu Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Ye, Y. (2008). Quadratic Programming over an Ellipsoid . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_539

Download citation

Publish with us

Policies and ethics

Search

Navigation