Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 1822–1831Cite as

Large Scale Trust Region Problems

LSTR

  • Reference work entry

  • 141 Accesses

Article Outline

Keywords

Algorithms Based on Successive Improvement of KKT Points

  EPA)

  DCA)

Parametric Eigenvalue Reformulation Based Algorithms

  IPE)

  Semidefinite Programming Approach (SDP)

Conclusion

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. Ben-tal A, Teboulle M (1996) Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math Program 72(1):51–63

    Article  MathSciNet  Google Scholar 

  2. Coleman TF, Li Y (1996) An interior trust region approach for nonlinear minimization subject to bounds. SIAM J Optim 6(2):418–445

    Article  MathSciNet  MATH  Google Scholar 

  3. Cullum JK, Willoughby RA (1985) Lanczos algorithms for large symmetric eigenvalue computation. Birkhäuser, Basel

    Google Scholar 

  4. Dembo RS, Steihaug T (1983) Truncated-Newton methods algorithms for large-scale unconstrained optimization. Math Program 26(2):190–212

    Article  MathSciNet  MATH  Google Scholar 

  5. DinhTao Pham, HoaiAn LeThi (1998) D.C. optimization algorithm for solving the trust region subproblem. SIAM J Optim 8(2):476–505

    Article  MathSciNet  Google Scholar 

  6. Facchinei F, Lucidi S (1995) Quadratically and superlinear convergent algorithms for the solution of inequality constrained optimization problems. J Optim Th Appl 85(2):265–289

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Grippo L, Lampariello F, Lucidi S (1989) A truncated Newton method with nonmonotone linesearch for unconstrained optimization. J Optim Th Appl 60(3):401–419

    Article  MathSciNet  MATH  Google Scholar 

  9. Grippo L, Lampariello F, Lucidi S (1991) A class of nonmonotone stabilization methods in unconstrained optimization. Numerische Math 59:779–805

    Article  MathSciNet  MATH  Google Scholar 

  10. Kamath A, Karmarkar N (1991) A continuous approach to compute upper bounds in quadratic maximization problems with integer constraints. In: Floudas CA, Pardalos PM (eds) Recent Advances in Global Optimization. Princeton Univ. Press, Princeton, pp 125–140

    Google Scholar 

  11. Karmarkar N (1990) An interior-point approach to {NP}-complete problems. In: Proc. Math. Program. Soc. Conf. Integer Programming and Combinatorial Optimization, pp 351–366

    Google Scholar 

  12. Karmarkar N, Resende MGC, Ramakrishnan KG (1991) An interior point algorithm to solve computationally difficult set covering problems. Math Program 52(3):597–618

    Article  MathSciNet  MATH  Google Scholar 

  13. Lucidi S, Palagi L, Roma M (1998) On some properties of quadratic programs with a convex quadratic constraint. SIAM J Optim 8(1):105–122

    Article  MathSciNet  MATH  Google Scholar 

  14. Martínez JM, Santos SA (1995) Trust region algorithms on arbitrary domains. Math Program 68(3):267–302

    Article  Google Scholar 

  15. Matlab (1995) Reference guide. MathWorks

    Google Scholar 

  16. Moré JJ, Sorensen DC (1983) Computing a trust region step. SIAM J Sci Statist Comput 4(3):553–572

    Article  MathSciNet  MATH  Google Scholar 

  17. Pardalos PM (1996) Continuous approches to discrete optimization problems. In: Di Pillo G, Giannessi F (eds) Nonlinear Optimization and Applications. Plenum, New York, pp 313–328

    Google Scholar 

  18. Pardalos PM, Ye Y, Han C-G (1991) Algorithms for the solution of quadratic knapsack problems. LAA 25:69–91

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. Rendl F, Wolkowicz H (1997) A semidefinite framework to trust region subproblems with applications to large scale minimization. Math Program 77(2):273–299

    MathSciNet  Google Scholar 

  21. Sartenaer A (1995) A class of trust region methods for nonlinear network optimization problems. SIAM J Optim 5(2):379–407

    Article  MathSciNet  MATH  Google Scholar 

  22. Sorensen DC (1982) Newton's method with a model trust region modification. SIAM J Sci Statist Comput 19(2):409–427

    MathSciNet  MATH  Google Scholar 

  23. Sorensen DC (1997) Minimization of a large-scale quadratic function subject to an ellipsoidal constraint. SIAM J Optim 7(1):141–161

    Article  MathSciNet  MATH  Google Scholar 

  24. Vavasis SA (1991) Nonlinear optimization. Oxford Univ. Press, Oxford

    MATH  Google Scholar 

  25. Ye Y (1991) A new complexity result on minimization of a quadratic function with a sphere constraint. In: Floudas CA, Pardalos PM (eds) Recent Advances in Global Optimization. Princeton Univ. Press, Princeton, pp 19–31

    Google Scholar 

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

    Article  Google Scholar 

  27. Ye Y, Tse E (1989) An extension of Karmarkar's projective algorithm for convex quadratic programming. Math Program 44:157–179

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIS, Universitá Roma ‘La Sapienza’, Rome, Italy

    Laura Palagi

Authors
  1. Laura Palagi
    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

Palagi, L. (2008). Large Scale Trust Region Problems . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_323

Download citation

Publish with us

Policies and ethics

Search

Navigation