Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Trust-region methodsJuly 2000
Publisher:
  • Society for Industrial and Applied Mathematics
  • 3600 University City Science Center Philadelphia, PA
  • United States
ISBN:978-0-89871-460-9
Published:01 July 2000
Pages:
959
Skip Bibliometrics Section
Reflects downloads up to 15 Oct 2024Bibliometrics
Abstract

No abstract available.

Cited By

  1. Pietrenko-Dabrowska A and Koziel S (2024). Low-cost and precise automated re-design of antenna structures using interleaved geometry scaling and gradient-based optimization, Knowledge-Based Systems, 284:C, Online publication date: 25-Jan-2024.
  2. Chakrabarty D, Graur A, Jiang H and Sidford A Parallel submodular function minimization Proceedings of the 37th International Conference on Neural Information Processing Systems, (68639-68654)
  3. Alavi F and Hashemi S (2022). A bi-level formulation for multiple kernel learning via self-paced training, Pattern Recognition, 129:C, Online publication date: 1-Sep-2022.
  4. ACM
    Porcelli M and Toint P (2022). Exploiting Problem Structure in Derivative Free Optimization, ACM Transactions on Mathematical Software, 48:1, (1-25), Online publication date: 31-Mar-2022.
  5. Weiss A, Arikan T, Vishnu H, Deane G, Singer A and Wornell G (2022). A Semi-Blind Method for Localization of Underwater Acoustic Sources, IEEE Transactions on Signal Processing, 70, (3090-3106), Online publication date: 1-Jan-2022.
  6. Kamm S, Sharma K, Jazdi N and Weyrich M A Hybrid Modelling Approach for Parameter Estimation of Analytical Reflection Models in the Failure Analysis Process of Semiconductors 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE), (417-422)
  7. Zhao Q and Chen Z (2020). A Line Search Penalty-Free Method for Nonlinear Second-Order Cone Programming, Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications, 170:1, (291-317), Online publication date: 1-Dec-2020.
  8. Cartis C, Gould N and Lange M (2019). On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces, BIT, 60:3, (583-589), Online publication date: 1-Sep-2020.
  9. Bergou E, Diouane Y and Kungurtsev V (2020). Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems, Journal of Optimization Theory and Applications, 185:3, (927-944), Online publication date: 1-Jun-2020.
  10. Royer C, O’Neill M and Wright S (2019). A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization, Mathematical Programming: Series A and B, 180:1-2, (451-488), Online publication date: 1-Mar-2020.
  11. Nguyen V, Nguyen T and Sheu R (2019). Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere, Journal of Global Optimization, 76:1, (121-135), Online publication date: 1-Jan-2020.
  12. Nouiehed M, Sanjabi M, Huang T, Lee J and Razaviyayn M Solving a class of non-convex min-max games using iterative first order methods Proceedings of the 33rd International Conference on Neural Information Processing Systems, (14934-14942)
  13. Gower R, Kovalev D, Lieder F and Richtárik P RSN Proceedings of the 33rd International Conference on Neural Information Processing Systems, (616-625)
  14. Vasquez D, Pasupathy R and Shashaani S Astro for derivative-based stochastic optimization Proceedings of the Winter Simulation Conference, (3563-3574)
  15. Morgan L, Nelson B, Titman A and Worthington D A spline-based method for modelling and generating a nonhomogeneous poisson process Proceedings of the Winter Simulation Conference, (356-367)
  16. Yeh C, Lo K and Lin W (2019). Visual-Quality Guided Global Backlight Dimming for Video Display on Mobile Devices, IEEE Transactions on Circuits and Systems for Video Technology, 29:11, (3393-3403), Online publication date: 1-Nov-2019.
  17. Chi Y, Lu Y and Chen Y (2019). Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview, IEEE Transactions on Signal Processing, 67:20, (5239-5269), Online publication date: 15-Oct-2019.
  18. ACM
    Cartis C, Fiala J, Marteau B and Roberts L (2019). Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers, ACM Transactions on Mathematical Software, 45:3, (1-41), Online publication date: 30-Sep-2019.
  19. Chen Z, Sim M and Xu H (2019). Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets, Operations Research, 67:5, (1328-1344), Online publication date: 1-Sep-2019.
  20. Birgin E and Martínez J (2019). A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization, Computational Optimization and Applications, 73:3, (707-753), Online publication date: 1-Jul-2019.
  21. Chen Y, Sun Y and Yin W (2019). Run-and-Inspect Method for nonconvex optimization and global optimality bounds for R-local minimizers, Mathematical Programming: Series A and B, 176:1-2, (39-67), Online publication date: 1-Jul-2019.
  22. Lee J, Panageas I, Piliouras G, Simchowitz M, Jordan M and Recht B (2019). First-order methods almost always avoid strict saddle points, Mathematical Programming: Series A and B, 176:1-2, (311-337), Online publication date: 1-Jul-2019.
  23. Cao M, Huang Q and Yang Y (2019). A self-adaptive trust region method for extreme ?$\mathcal {B}$-eigenvalues of symmetric tensors, Numerical Algorithms, 81:2, (407-420), Online publication date: 1-Jun-2019.
  24. Alla A, Hinze M, Kolvenbach P, Lass O and Ulbrich S (2019). A certified model reduction approach for robust parameter optimization with PDE constraints, Advances in Computational Mathematics, 45:3, (1221-1250), Online publication date: 1-Jun-2019.
  25. Roosta-Khorasani F and Mahoney M (2019). Sub-sampled Newton methods, Mathematical Programming: Series A and B, 174:1-2, (293-326), Online publication date: 1-Mar-2019.
  26. Previati G, Ballo F and Gobbi M (2019). Concurrent topological optimization of two bodies sharing design space, Structural and Multidisciplinary Optimization, 59:3, (745-757), Online publication date: 1-Mar-2019.
  27. Xia Y, Wang L and Yang M (2019). A fast algorithm for globally solving Tikhonov regularized total least squares problem, Journal of Global Optimization, 73:2, (311-330), Online publication date: 1-Feb-2019.
  28. Virgili-Llop J, Zagaris C, Zappulla R, Bradstreet A and Romano M (2019). A convex-programming-based guidance algorithm to capture a tumbling object on orbit using a spacecraft equipped with a robotic manipulator, International Journal of Robotics Research, 38:1, (40-72), Online publication date: 1-Jan-2019.
  29. Adachi S and Nakatsukasa Y (2019). Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint, Mathematical Programming: Series A and B, 173:1-2, (79-116), Online publication date: 1-Jan-2019.
  30. Morgan L Modelling and generating nonhomogeneous poisson processes using a spline function Proceedings of the 2018 Winter Simulation Conference, (4148-4149)
  31. Carmon Y and Duchi J Analysis of Krylov subspace solutions of regularized nonconvex quadratic problems Proceedings of the 32nd International Conference on Neural Information Processing Systems, (10728-10738)
  32. Zhang R, Josz C, Sojoudi S and Lavaei J How much restricted isometry is needed in nonconvex matrix recovery? Proceedings of the 32nd International Conference on Neural Information Processing Systems, (5591-5602)
  33. Kuiteing A, Marcotte P and Savard G (2018). Pricing and revenue maximization over a multicommodity transportation network, Computational Optimization and Applications, 71:3, (641-671), Online publication date: 1-Dec-2018.
  34. Audet C, Conn A, Le Digabel S and Peyrega M (2018). A progressive barrier derivative-free trust-region algorithm for constrained optimization, Computational Optimization and Applications, 71:2, (307-329), Online publication date: 1-Nov-2018.
  35. Bellavia S, Gratton S and Riccietti E (2018). A Levenberg---Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients, Numerische Mathematik, 140:3, (791-825), Online publication date: 1-Nov-2018.
  36. Le Thi H, Huynh V and Pham Dinh T (2018). Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data, Journal of Optimization Theory and Applications, 179:1, (103-126), Online publication date: 1-Oct-2018.
  37. Sun J, Qu Q and Wright J (2018). A Geometric Analysis of Phase Retrieval, Foundations of Computational Mathematics, 18:5, (1131-1198), Online publication date: 1-Oct-2018.
  38. Cartis C, Gould N and Toint P (2018). Second-Order Optimality and Beyond, Foundations of Computational Mathematics, 18:5, (1073-1107), Online publication date: 1-Oct-2018.
  39. Elisov L, Gorbachenko V and Zhukov M (2018). Learning Radial Basis Function Networks with the Trust Region Method for Boundary Problems, Automation and Remote Control, 79:9, (1621-1629), Online publication date: 1-Sep-2018.
  40. Bergou E, Diouane Y and Gratton S (2018). A Line-Search Algorithm Inspired by the Adaptive Cubic Regularization Framework and Complexity Analysis, Journal of Optimization Theory and Applications, 178:3, (885-913), Online publication date: 1-Sep-2018.
  41. Bellavia S and Riccietti E (2018). On an Elliptical Trust-Region Procedure for Ill-Posed Nonlinear Least-Squares Problems, Journal of Optimization Theory and Applications, 178:3, (824-859), Online publication date: 1-Sep-2018.
  42. Sheng Z and Yuan G (2018). An effective adaptive trust region algorithm for nonsmooth minimization, Computational Optimization and Applications, 71:1, (251-271), Online publication date: 1-Sep-2018.
  43. De Leone R, Fasano G and Sergeyev Y (2018). Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming, Computational Optimization and Applications, 71:1, (73-93), Online publication date: 1-Sep-2018.
  44. Nesterov Y (2018). Complexity bounds for primal-dual methods minimizing the model of objective function, Mathematical Programming: Series A and B, 171:1-2, (311-330), Online publication date: 1-Sep-2018.
  45. Barreto J and Corves B Matching the Free-Vibration Response of a Delta Robot with Pick-and-Place Tasks Using Multi-Body Simulation 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), (1487-1492)
  46. Montanher T, Neumaier A and Domes F (2018). A computational study of global optimization solvers on two trust region subproblems, Journal of Global Optimization, 71:4, (915-934), Online publication date: 1-Aug-2018.
  47. Yang B, Anstreicher K and Burer S (2018). Quadratic programs with hollows, Mathematical Programming: Series A and B, 170:2, (541-553), Online publication date: 1-Aug-2018.
  48. Bomze I, Jeyakumar V and Li G (2018). Extended trust-region problems with one or two balls, Journal of Global Optimization, 71:3, (551-569), Online publication date: 1-Jul-2018.
  49. ACM
    Allen-Zhu Z, Garg A, Li Y, Oliveira R and Wigderson A Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, (172-181)
  50. Haeser G (2018). A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Computational Optimization and Applications, 70:2, (615-639), Online publication date: 1-Jun-2018.
  51. Jiang H, Robinson D, Vidal R and You C (2018). A nonconvex formulation for low rank subspace clustering, Computational Optimization and Applications, 70:2, (395-418), Online publication date: 1-Jun-2018.
  52. Jiang R, Li D and Wu B (2018). SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices, Mathematical Programming: Series A and B, 169:2, (531-563), Online publication date: 1-Jun-2018.
  53. Carraro T, Dörsam S, Frei S and Schwarz D (2018). An Adaptive Newton Algorithm for Optimal Control Problems with Application to Optimal Electrode Design, Journal of Optimization Theory and Applications, 177:2, (498-534), Online publication date: 1-May-2018.
  54. Le Thi H and Pham Dinh T (2018). DC programming and DCA, Mathematical Programming: Series A and B, 169:1, (5-68), Online publication date: 1-May-2018.
  55. Caliciotti A, Fasano G and Roma M (2018). Preconditioned Nonlinear Conjugate Gradient methods based on a modified secant equation, Applied Mathematics and Computation, 318:C, (196-214), Online publication date: 1-Feb-2018.
  56. Zhou R, Shen X and Niu L (2018). A fast algorithm for nonsmooth penalized clustering, Neurocomputing, 273:C, (583-592), Online publication date: 17-Jan-2018.
  57. Barbero À and Sra S (2018). Modular proximal optimization for multidimensional total-variation regularization, The Journal of Machine Learning Research, 19:1, (2232-2313), Online publication date: 1-Jan-2018.
  58. Bergou E, Diouane Y and Gratton S (2017). On the use of the energy norm in trust-region and adaptive cubic regularization subproblems, Computational Optimization and Applications, 68:3, (533-554), Online publication date: 1-Dec-2017.
  59. Dener A and Hicken J (2017). Matrix-free algorithm for the optimization of multidisciplinary systems, Structural and Multidisciplinary Optimization, 56:6, (1429-1446), Online publication date: 1-Dec-2017.
  60. Patan G (2017). Mesh-based and meshless design and approximation of scalar functions, Computer Aided Geometric Design, 57:C, (23-43), Online publication date: 1-Oct-2017.
  61. Alkilayh M, Reichel L and Yuan J (2017). New zero-finders for trust-region computations, Numerical Algorithms, 76:2, (361-375), Online publication date: 1-Oct-2017.
  62. Wu X, Wen Z and Bao W (2017). A Regularized Newton Method for Computing Ground States of Bose---Einstein Condensates, Journal of Scientific Computing, 73:1, (303-329), Online publication date: 1-Oct-2017.
  63. Kohler J and Lucchi A Sub-sampled cubic regularization for non-convex optimization Proceedings of the 34th International Conference on Machine Learning - Volume 70, (1895-1904)
  64. Marra G and Radice R (2017). Bivariate copula additive models for location, scale and shape, Computational Statistics & Data Analysis, 112:C, (99-113), Online publication date: 1-Aug-2017.
  65. Hours J and Jones C (2017). An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the Optimal Power Flow Problem, Journal of Optimization Theory and Applications, 173:3, (844-877), Online publication date: 1-Jun-2017.
  66. Armand P and Omheni R (2017). A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear Optimization, Journal of Optimization Theory and Applications, 173:2, (523-547), Online publication date: 1-May-2017.
  67. Gould N and Robinson D (2017). A dual gradient-projection method for large-scale strictly convex quadratic problems, Computational Optimization and Applications, 67:1, (1-38), Online publication date: 1-May-2017.
  68. Bandeira A, Boumal N and Singer A (2017). Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, Mathematical Programming: Series A and B, 163:1-2, (145-167), Online publication date: 1-May-2017.
  69. Elham A and Tooren M (2017). Multi-fidelity wing aerostructural optimization using a trust region filter-SQP algorithm, Structural and Multidisciplinary Optimization, 55:5, (1773-1786), Online publication date: 1-May-2017.
  70. Bergström P and Edlund O (2017). Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach, Numerical Algorithms, 74:3, (755-779), Online publication date: 1-Mar-2017.
  71. Brust J, Erway J and Marcia R (2017). On solving L-SR1 trust-region subproblems, Computational Optimization and Applications, 66:2, (245-266), Online publication date: 1-Mar-2017.
  72. Salahi M, Taati A and Wolkowicz H (2017). Local nonglobal minima for solving large-scale extended trust-region subproblems, Computational Optimization and Applications, 66:2, (223-244), Online publication date: 1-Mar-2017.
  73. Burer S and Kılınç-Karzan F (2017). How to convexify the intersection of a second order cone and a nonconvex quadratic, Mathematical Programming: Series A and B, 162:1-2, (393-429), Online publication date: 1-Mar-2017.
  74. Curtis F, Robinson D and Samadi M (2017). A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$O(∈-3/2) for nonconvex optimization, Mathematical Programming: Series A and B, 162:1-2, (1-32), Online publication date: 1-Mar-2017.
  75. Dieker A, Ghosh S and Squillante M (2016). Optimal Resource Capacity Management for Stochastic Networks, Operations Research, 65:1, (221-241), Online publication date: 1-Feb-2017.
  76. Muoi B and Yen N (2017). Local Stability and Local Convergence of the Basic Trust-Region Method, Journal of Optimization Theory and Applications, 172:2, (578-593), Online publication date: 1-Feb-2017.
  77. Jensen T and Diehl M (2017). An Approach for Analyzing the Global Rate of Convergence of Quasi-Newton and Truncated-Newton Methods, Journal of Optimization Theory and Applications, 172:1, (206-221), Online publication date: 1-Jan-2017.
  78. Cartis C, Gould N and Toint P (2017). Corrigendum, Mathematical Programming: Series A and B, 161:1-2, (611-626), Online publication date: 1-Jan-2017.
  79. Curtis F, Gould N, Robinson D and Toint P (2017). An interior-point trust-funnel algorithm for nonlinear optimization, Mathematical Programming: Series A and B, 161:1-2, (73-134), Online publication date: 1-Jan-2017.
  80. Kimiaei M and Esmaeili H (2016). A trust-region approach with novel filter adaptive radius for system of nonlinear equations, Numerical Algorithms, 73:4, (999-1016), Online publication date: 1-Dec-2016.
  81. Fasano G and Roma M (2016). A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization, Computational Optimization and Applications, 65:2, (399-429), Online publication date: 1-Nov-2016.
  82. Bekasiewicz A and Koziel S (2016). Accelerated geometry optimization of compact impedance matching transformers using decomposition and adjoint sensitivities, International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 29:6, (1140-1148), Online publication date: 1-Nov-2016.
  83. Carrizo G, Lotito P and Maciel M (2016). Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem, Mathematical Programming: Series A and B, 159:1-2, (339-369), Online publication date: 1-Sep-2016.
  84. Shen C, Zhang L and Liu W (2016). A stabilized filter SQP algorithm for nonlinear programming, Journal of Global Optimization, 65:4, (677-708), Online publication date: 1-Aug-2016.
  85. Hazan E and Koren T (2016). A linear-time algorithm for trust region problems, Mathematical Programming: Series A and B, 158:1-2, (363-381), Online publication date: 1-Jul-2016.
  86. Siegler J, Ren J, Leifsson L, Koziel S and Bekasiewicz A (2016). Supersonic Airfoil Shape Optimization by Variable-fidelity Models and Manifold Mapping, Procedia Computer Science, 80:C, (1103-1113), Online publication date: 1-Jun-2016.
  87. Chiang N and Zavala V (2016). An inertia-free filter line-search algorithm for large-scale nonlinear programming, Computational Optimization and Applications, 64:2, (327-354), Online publication date: 1-Jun-2016.
  88. Bellavia S, Morini B and Riccietti E (2016). On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation, Computational Optimization and Applications, 64:1, (1-30), Online publication date: 1-May-2016.
  89. Hanba S (2016). Adaptive set-point regulation of discrete-time nonlinear systems, International Journal of Adaptive Control and Signal Processing, 30:4, (599-607), Online publication date: 1-Apr-2016.
  90. Wang J, Wang R, Jing H and Chen N (2016). Coordinated Active Steering and Four-Wheel Independently Driving/Braking Control with Control Allocation, Asian Journal of Control, 18:1, (98-111), Online publication date: 1-Jan-2016.
  91. Jin J, Cai X, Lai G and Lin X (2015). GPU-accelerated parallel algorithms for linear rankSVM, The Journal of Supercomputing, 71:11, (4141-4171), Online publication date: 1-Nov-2015.
  92. Muñoz M, Sun Y, Kirley M and Halgamuge S (2015). Algorithm selection for black-box continuous optimization problems, Information Sciences: an International Journal, 317:C, (224-245), Online publication date: 1-Oct-2015.
  93. Martínez J and Raydan M (2015). Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization, Journal of Global Optimization, 63:2, (319-342), Online publication date: 1-Oct-2015.
  94. Tesfahunegn Y, Koziel S, Leifsson L and Bekasiewicz A (2015). Surrogate-based Airfoil Design with Space Mapping and Adjoint Sensitivity, Procedia Computer Science, 51:C, (795-804), Online publication date: 1-Sep-2015.
  95. Koziel S and Ogurtsov S (2015). Phase-spacing optimization of linear microstrip antenna arrays using simulation-based surrogate superposition models, International Journal of RF and Microwave Computer-Aided Engineering, 25:6, (536-547), Online publication date: 1-Aug-2015.
  96. Bomze I and Overton M (2015). Narrowing the difficulty gap for the Celis---Dennis---Tapia problem, Mathematical Programming: Series A and B, 151:2, (459-476), Online publication date: 1-Jul-2015.
  97. Koziel S and Ogurtsov S (2015). Fast simulation-driven optimization of planar microstrip antenna arrays using surrogate superposition models, International Journal of RF and Microwave Computer-Aided Engineering, 25:5, (371-381), Online publication date: 1-Jun-2015.
  98. Zhou Q and Hang D (2015). Nonmonotone adaptive trust region method with line search based on new diagonal updating, Applied Numerical Mathematics, 91:C, (75-88), Online publication date: 1-May-2015.
  99. Sampaio P and Toint P (2015). A derivative-free trust-funnel method for equality-constrained nonlinear optimization, Computational Optimization and Applications, 61:1, (25-49), Online publication date: 1-May-2015.
  100. Huang W, Absil P and Gallivan K (2015). A Riemannian symmetric rank-one trust-region method, Mathematical Programming: Series A and B, 150:2, (179-216), Online publication date: 1-May-2015.
  101. Lewis A and Zhang S (2015). Nonsmoothness and a Variable Metric Method, Journal of Optimization Theory and Applications, 165:1, (151-171), Online publication date: 1-Apr-2015.
  102. Birgin E, Martínez J and Prudente L (2015). Optimality properties of an Augmented Lagrangian method on infeasible problems, Computational Optimization and Applications, 60:3, (609-631), Online publication date: 1-Apr-2015.
  103. Fasano G (2015). A Framework of Conjugate Direction Methods for Symmetric Linear Systems in Optimization, Journal of Optimization Theory and Applications, 164:3, (883-914), Online publication date: 1-Mar-2015.
  104. Akbari Z, Yousefpour R and Reza Peyghami M (2015). A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems, Journal of Optimization Theory and Applications, 164:3, (733-754), Online publication date: 1-Mar-2015.
  105. Cartis C, Fowkes J and Gould N (2015). Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, Journal of Global Optimization, 61:3, (429-457), Online publication date: 1-Mar-2015.
  106. Deng Z, Fang S, Jin Q and Lu C (2015). Conic approximation to nonconvex quadratic programming with convex quadratic constraints, Journal of Global Optimization, 61:3, (459-478), Online publication date: 1-Mar-2015.
  107. Burer S and Yang B (2015). The trust region subproblem with non-intersecting linear constraints, Mathematical Programming: Series A and B, 149:1-2, (253-264), Online publication date: 1-Feb-2015.
  108. Jeyakumar V and Li G (2014). Trust-region problems with linear inequality constraints, Mathematical Programming: Series A and B, 147:1-2, (171-206), Online publication date: 1-Oct-2014.
  109. Chrétien S and Ortega J (2014). Multivariate GARCH estimation via a Bregman-proximal trust-region method, Computational Statistics & Data Analysis, 76:C, (210-236), Online publication date: 1-Aug-2014.
  110. Zhang Z (2014). Sobolev seminorm of quadratic functions with applications to derivative-free optimization, Mathematical Programming: Series A and B, 146:1-2, (77-96), Online publication date: 1-Aug-2014.
  111. ACM
    Erway J and Marcia R (2014). Algorithm 943, ACM Transactions on Mathematical Software, 40:4, (1-12), Online publication date: 1-Jun-2014.
  112. Amos B, Easterling D, Watson L, Castle B, Trosset M and Thacker W Fortran 95 implementation of QNSTOP for global and stochastic optimization Proceedings of the High Performance Computing Symposium, (1-8)
  113. Bienstock D and Michalka A Polynomial solvability of variants of the trust-region subproblem Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (380-390)
  114. Yuan G, Wei Z and Li G (2014). A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, Journal of Computational and Applied Mathematics, 255:C, (86-96), Online publication date: 1-Jan-2014.
  115. Ghosh S, Heching A and Squillante M A two-phase approach for stochastic optimization of complex business processes Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, (1856-1868)
  116. Amaran S, Sahinidis N, Sharda B and Bury S A trust region-based algorithm for continuous optimization via simulation Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, (4020-4021)
  117. Zhou Q, Zhou F and Cao F (2013). A nonmonotone trust region method based on simple conic models for unconstrained optimization, Applied Mathematics and Computation, 225, (295-305), Online publication date: 1-Dec-2013.
  118. Houska B and Diehl M (2013). Nonlinear robust optimization via sequential convex bilevel programming, Mathematical Programming: Series A and B, 142:1-2, (539-577), Online publication date: 1-Dec-2013.
  119. (2013). Integrated assessment model of society-biosphere-climate-economy-energy system, Environmental Modelling & Software, 49:C, (1-21), Online publication date: 1-Nov-2013.
  120. Olympio J (2013). A Continuous Implementation of a Second-Variation Optimal Control Method for Space Trajectory Problems, Journal of Optimization Theory and Applications, 158:3, (687-716), Online publication date: 1-Sep-2013.
  121. Willms A and Szusz E (2013). Parameter range reduction for ODE models using monotonic discretizations, Journal of Computational and Applied Mathematics, 247, (124-151), Online publication date: 1-Aug-2013.
  122. Fowkes J, Gould N and Farmer C (2013). A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions, Journal of Global Optimization, 56:4, (1791-1815), Online publication date: 1-Aug-2013.
  123. AhipaşAoğLu S and Todd M (2013). A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders, Computational Geometry: Theory and Applications, 46:5, (494-519), Online publication date: 1-Jul-2013.
  124. Chang K, Hong L and Wan H (2013). Stochastic Trust-Region Response-Surface Method STRONG---A New Response-Surface Framework for Simulation Optimization, INFORMS Journal on Computing, 25:2, (230-243), Online publication date: 1-Apr-2013.
  125. ACM
    Park P, Fischione C and Johansson K (2013). Modeling and stability analysis of hybrid multiple access in the IEEE 802.15.4 protocol, ACM Transactions on Sensor Networks, 9:2, (1-55), Online publication date: 1-Mar-2013.
  126. Osorio C and Bidkhori H Combining metamodel techniques and Bayesian selection procedures to derive computationally efficient simulation-based optimization algorithms Proceedings of the Winter Simulation Conference, (1-9)
  127. Dostál Z and Kozubek T (2012). An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications, Mathematical Programming: Series A and B, 135:1-2, (195-220), Online publication date: 1-Oct-2012.
  128. Sambo F, Montes de Oca M, Di Camillo B, Toffolo G and Stutzle T (2012). MORE, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:5, (1459-1471), Online publication date: 1-Sep-2012.
  129. Ngoc Tuan H (2012). Convergence Rate of the Pham Dinh---Le Thi Algorithm for the Trust-Region Subproblem, Journal of Optimization Theory and Applications, 154:3, (904-915), Online publication date: 1-Sep-2012.
  130. Ben Gharbia I and Gilbert J (2012). Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix, Mathematical Programming: Series A and B, 134:2, (349-364), Online publication date: 1-Sep-2012.
  131. Lantoine G and Russell R (2012). A Hybrid Differential Dynamic Programming Algorithm for Constrained Optimal Control Problems. Part 1, Journal of Optimization Theory and Applications, 154:2, (382-417), Online publication date: 1-Aug-2012.
  132. Martínez J and Prudente L (2012). Handling infeasibility in a large-scale nonlinear optimization algorithm, Numerical Algorithms, 60:2, (263-277), Online publication date: 1-Jun-2012.
  133. Koziel S and Leifsson L (2012). Simulation-driven design using surrogate-based optimization and variable-resolution computational fluid dynamic models, Journal of Computational Methods in Sciences and Engineering, 12:1-2, (75-98), Online publication date: 1-Jan-2012.
  134. Prieß M, Piwonski J, Koziel S and Slawig T (2012). Parameter identification in climate models using surrogate-based optimization, Journal of Computational Methods in Sciences and Engineering, 12:1-2, (47-62), Online publication date: 1-Jan-2012.
  135. Chang K, Li M and Wan H Combining strong and screening designs for large-scale simulation optimization Proceedings of the Winter Simulation Conference, (4127-4138)
  136. ACM
    Chang C, Gorissen B and Melchior S (2011). Fast oriented bounding box optimization on the rotation group SO(3,ℝ), ACM Transactions on Graphics, 30:5, (1-16), Online publication date: 1-Oct-2011.
  137. Yu Z and Wang A (2011). Global Convergence of a Nonmonotone Trust Region Algorithm with Memory for Unconstrained Optimization, Journal of Mathematical Modelling and Algorithms, 10:2, (109-118), Online publication date: 1-Jun-2011.
  138. Etoa J A filter method to solve nonlinear bilevel programming problems Proceedings of the First international conference on Information computing and applications, (395-406)
  139. Etoa J A Filter Method to Solve Nonlinear Bilevel Programming Problems Proceedings of the First International Conference on Information Computing and Applications - Volume 6377, (395-406)
  140. Relan J, Pop M, Delingette H, Wright G, Ayache N and Sermesant M Estimation of reaction, diffusion and restitution parameters for a 3D myocardial model using optical mapping and MRI Proceedings of the First international conference on Statistical atlases and computational models of the heart, and international conference on Cardiac electrophysiological simulation challenge, (270-280)
  141. Kim D, Sra S and Dhillon I A scalable trust-region algorithm with application to mixed-norm regression Proceedings of the 27th International Conference on International Conference on Machine Learning, (519-526)
  142. Bierlaire M, Thémans M and Zufferey N (2010). A Heuristic for Nonlinear Global Optimization, INFORMS Journal on Computing, 22:1, (59-70), Online publication date: 1-Jan-2010.
  143. Ryu J, Kim S and Wan H Pareto front approximation with adaptive weighted sum method in multiobjective simulation optimization Winter Simulation Conference, (623-633)
  144. Sambo F, de Oca M, Di Camillo B and Stützle T On the difficulty of inferring gene regulatory networks Proceedings of the 9th international conference on Artificial evolution, (74-85)
  145. Gulati S, Jhurani C, Kuipers B and Longoria R A framework for planning comfortable and customizable motion of an assistive mobile robot Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (4253-4260)
  146. Xue W, Shen C and Pu D (2009). A penalty-function-free line search SQP method for nonlinear programming, Journal of Computational and Applied Mathematics, 228:1, (313-325), Online publication date: 1-Jun-2009.
  147. Attar A, Nakhai M and Aghvami A (2009). Cognitive radio game for secondary spectrum access problem, IEEE Transactions on Wireless Communications, 8:4, (2121-2131), Online publication date: 1-Apr-2009.
  148. Toint P, Tomanos D and Weber-Mendonca M (2009). A multilevel algorithm for solving the trust-region subproblem, Optimization Methods & Software, 24:2, (299-311), Online publication date: 1-Apr-2009.
  149. Tseng P and Yun S (2009). A coordinate gradient descent method for nonsmooth separable minimization, Mathematical Programming: Series A and B, 117:1-2, (387-423), Online publication date: 1-Mar-2009.
  150. ACM
    Reid J and Scott J (2009). An out-of-core sparse Cholesky solver, ACM Transactions on Mathematical Software, 36:2, (1-33), Online publication date: 1-Mar-2009.
  151. ACM
    Lourakis M and Argyros A (2009). SBA, ACM Transactions on Mathematical Software, 36:1, (1-30), Online publication date: 1-Mar-2009.
  152. Cartis C, Gould N and Toint P (2009). Trust-region and other regularisations of linear least-squares problems, BIT, 49:1, (21-53), Online publication date: 1-Mar-2009.
  153. Qu S, Jiang S and Zhu Y (2009). A conic trust-region method and its convergence properties, Computers & Mathematics with Applications, 57:4, (513-528), Online publication date: 1-Feb-2009.
  154. ACM
    Dieker A, Ghosh S and Squillante M (2008). Capacity optimization in feedforward Brownian networks, ACM SIGMETRICS Performance Evaluation Review, 36:2, (137-139), Online publication date: 31-Aug-2008.
  155. Wang C, Zhang J and Zhao W (2008). Two Error Bounds for Constrained Optimization Problems and Their Applications, Applied Mathematics and Optimization, 57:3, (307-328), Online publication date: 1-Jun-2008.
  156. Gu N and Mo J (2008). Incorporating nonmonotone strategies into the trust region method for unconstrained optimization, Computers & Mathematics with Applications, 55:9, (2158-2172), Online publication date: 1-May-2008.
  157. Shi Z and Guo J (2008). A new trust region method for unconstrained optimization, Journal of Computational and Applied Mathematics, 213:2, (509-520), Online publication date: 20-Mar-2008.
  158. ACM
    Rojas M, Santos S and Sorensen D (2008). Algorithm 873, ACM Transactions on Mathematical Software, 34:2, (1-28), Online publication date: 1-Mar-2008.
  159. Conn A, Scheinberg K and Vicente L (2008). Geometry of interpolation sets in derivative free optimization, Mathematical Programming: Series A and B, 111:1-2, (141-172), Online publication date: 1-Jan-2008.
  160. Chang K, Hong L and Wan H Stochastic trust region gradient-free method (strong) Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come, (346-354)
  161. Herty M, Pinnau R and Seaïd M (2007). Optimal control in radiative transfer, Optimization Methods & Software, 22:6, (917-936), Online publication date: 1-Dec-2007.
  162. Bellavia S and Berrone S (2007). Globalization strategies for Newton-Krylov methods for stabilized FEM discretization of Navier-Stokes equations, Journal of Computational Physics, 226:2, (2317-2340), Online publication date: 1-Oct-2007.
  163. Bajramovic F and Denzler J Self-calibration with partially known rotations Proceedings of the 29th DAGM conference on Pattern recognition, (1-10)
  164. Lu J, Engl H, Machné R and Schuster P Inverse bifurcation analysis of a model for the mammalian G1/S regulatory module Proceedings of the 1st international conference on Bioinformatics research and development, (168-184)
  165. Lu Z and Monteiro R (2007). A modified nearly exact method for solving low-rank trust region subproblem, Mathematical Programming: Series A and B, 109:2-3, (385-411), Online publication date: 1-Mar-2007.
  166. ACM
    Gould N and Toint P (2007). FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems, ACM Transactions on Mathematical Software, 33:1, (3-es), Online publication date: 1-Mar-2007.
  167. Nesterov Y and Polyak B (2006). Cubic regularization of Newton method and its global performance, Mathematical Programming: Series A and B, 108:1, (177-205), Online publication date: 1-Aug-2006.
  168. Absil P, Baker C and Gallivan K (2006). A truncated-CG style method for symmetric generalized eigenvalue problems, Journal of Computational and Applied Mathematics, 189:1-2, (274-285), Online publication date: 1-May-2006.
  169. Zhang J, Wang Y and Zhang X (2006). Superlinearly Convergent Trust-Region Method without the Assumption of Positive-Definite Hessian, Journal of Optimization Theory and Applications, 129:1, (201-218), Online publication date: 1-Apr-2006.
  170. Wächter A and Biegler L (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Mathematical Programming: Series A and B, 106:1, (25-57), Online publication date: 1-Mar-2006.
  171. Noll D and Apkarian P (2005). Spectral bundle methods for non-convex maximum eigenvalue functions, Mathematical Programming: Series A and B, 104:2-3, (729-747), Online publication date: 1-Nov-2005.
  172. Becker R and Vexler B (2005). Mesh refinement and numerical sensitivity analysis for parameter calibration of partial differential equations, Journal of Computational Physics, 206:1, (95-110), Online publication date: 10-Jun-2005.
  173. Colson B, Marcotte P and Savard G (2005). A Trust-Region Method for Nonlinear Bilevel Programming, Computational Optimization and Applications, 30:3, (211-227), Online publication date: 1-Mar-2005.
  174. Negoita C and Renaut R (2005). On the Convergence of the Generalized Linear Least Squares Algorithm, BIT, 45:1, (137-158), Online publication date: 1-Mar-2005.
  175. Kovács K and Kocsor A (2005). Classification using a sparse combination of basis functions, Acta Cybernetica, 17:2, (311-323), Online publication date: 10-Jan-2005.
  176. Xu D, Han J and Chen Z (2004). Nonmonotone Trust-Region Method for Nonlinear Programming with General Constraints and Simple Bounds, Journal of Optimization Theory and Applications, 122:1, (185-206), Online publication date: 1-Jul-2004.
  177. Arora N and Biegler L (2004). A Trust Region SQP Algorithm for Equality Constrained Parameter Estimation with Simple Parameter Bounds, Computational Optimization and Applications, 28:1, (51-86), Online publication date: 1-Apr-2004.
  178. Liu T and Chen H (2004). Real-Time Tracking Using Trust-Region Methods, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:3, (397-402), Online publication date: 1-Mar-2004.
  179. Byrd R, Marazzi M and Nocedal J (2004). On the convergence of Newton iterations to non-stationary points, Mathematical Programming: Series A and B, 99:1, (127-148), Online publication date: 1-Jan-2004.
  180. Byrd R, Nocedal J and Waltz R (2003). Feasible Interior Methods Using Slacks for Nonlinear Optimization, Computational Optimization and Applications, 26:1, (35-61), Online publication date: 1-Oct-2003.
  181. Mizutani E and Demmel J (2003). On structure-exploiting trust-region regularized nonlinear least squares algorithms for neural-network learning, Neural Networks, 16:5-6, (745-753), Online publication date: 1-Jun-2003.
  182. Angün E, Kleijnen J, Hertog D and Gürkan G Recent advances in simulation optimization Proceedings of the 34th conference on Winter simulation: exploring new frontiers, (377-383)
  183. Birgin E and Mario Martínez J (2002). Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients, Computational Optimization and Applications, 23:1, (101-125), Online publication date: 1-Oct-2002.
  184. ACM
    Conn A and Visweswariah C Overview of continuous optimization advances and applications to circuit tuning Proceedings of the 2001 international symposium on Physical design, (74-81)
  185. Yu Z, Wang C and Yu J (1986). Combining trust region and linesearch algorithm for equality constrained optimization, Journal of Applied Mathematics and Computing, 14:1-2, (123-136), Online publication date: 1-Jan-1986.
  186. Fonseca C and Wanner E A quadratic approximation-based local search operator for handling two equality constraints in continuous optimization problems 2016 IEEE Congress on Evolutionary Computation (CEC), (4911-4917)
Contributors
  • IBM Thomas J. Watson Research Center
  • Rutherford Appleton Laboratory
  • University of Namur

Recommendations