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
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ben-tal A, Teboulle M (1996) Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math Program 72(1):51–63
Coleman TF, Li Y (1996) An interior trust region approach for nonlinear minimization subject to bounds. SIAM J Optim 6(2):418–445
Cullum JK, Willoughby RA (1985) Lanczos algorithms for large symmetric eigenvalue computation. Birkhäuser, Basel
Dembo RS, Steihaug T (1983) Truncated-Newton methods algorithms for large-scale unconstrained optimization. Math Program 26(2):190–212
DinhTao Pham, HoaiAn LeThi (1998) D.C. optimization algorithm for solving the trust region subproblem. SIAM J Optim 8(2):476–505
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
Gay DM (1981) Computing optimal locally constrained steps. SIAM J Sci Statist Comput 2(2):186–197
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
Grippo L, Lampariello F, Lucidi S (1991) A class of nonmonotone stabilization methods in unconstrained optimization. Numerische Math 59:779–805
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
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
Karmarkar N, Resende MGC, Ramakrishnan KG (1991) An interior point algorithm to solve computationally difficult set covering problems. Math Program 52(3):597–618
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
Martínez JM, Santos SA (1995) Trust region algorithms on arbitrary domains. Math Program 68(3):267–302
Matlab (1995) Reference guide. MathWorks
Moré JJ, Sorensen DC (1983) Computing a trust region step. SIAM J Sci Statist Comput 4(3):553–572
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
Pardalos PM, Ye Y, Han C-G (1991) Algorithms for the solution of quadratic knapsack problems. LAA 25:69–91
Powell MJD, Yuan Y (1991) A trust region algorithm for equality constrained optimization. Math Program 49:189–211
Rendl F, Wolkowicz H (1997) A semidefinite framework to trust region subproblems with applications to large scale minimization. Math Program 77(2):273–299
Sartenaer A (1995) A class of trust region methods for nonlinear network optimization problems. SIAM J Optim 5(2):379–407
Sorensen DC (1982) Newton's method with a model trust region modification. SIAM J Sci Statist Comput 19(2):409–427
Sorensen DC (1997) Minimization of a large-scale quadratic function subject to an ellipsoidal constraint. SIAM J Optim 7(1):141–161
Vavasis SA (1991) Nonlinear optimization. Oxford Univ. Press, Oxford
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
Ye Y (1992) On affine scaling algorithms for nonconvex quadratic programming. Math Program 56:285–300
Ye Y, Tse E (1989) An extension of Karmarkar's projective algorithm for convex quadratic programming. Math Program 44:157–179
Yuan Y (1990) On a subproblem of trust region algorithms for constrained optimization. Math Program 47:33–63
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-0-387-74759-0_323
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering