Добірка наукової літератури з теми "Generalized trust region subproblem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Generalized trust region subproblem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Generalized trust region subproblem"
Pong, Ting Kei, and Henry Wolkowicz. "The generalized trust region subproblem." Computational Optimization and Applications 58, no. 2 (January 17, 2014): 273–322. http://dx.doi.org/10.1007/s10589-013-9635-7.
Повний текст джерелаJia, Zhongxiao, and Fa Wang. "The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem." SIAM Journal on Optimization 31, no. 1 (January 2021): 887–914. http://dx.doi.org/10.1137/19m1279691.
Повний текст джерелаAdachi, Satoru, Satoru Iwata, Yuji Nakatsukasa, and Akiko Takeda. "Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem." SIAM Journal on Optimization 27, no. 1 (January 2017): 269–91. http://dx.doi.org/10.1137/16m1058200.
Повний текст джерелаSalahi, M., and A. Taati. "An efficient algorithm for solving the generalized trust region subproblem." Computational and Applied Mathematics 37, no. 1 (May 13, 2016): 395–413. http://dx.doi.org/10.1007/s40314-016-0349-1.
Повний текст джерелаJiang, Rujun, and Duan Li. "Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem." SIAM Journal on Optimization 29, no. 2 (January 2019): 1603–33. http://dx.doi.org/10.1137/18m1174313.
Повний текст джерелаWang, Shu, and Yong Xia. "Strong duality for generalized trust region subproblem: S-lemma with interval bounds." Optimization Letters 9, no. 6 (October 14, 2014): 1063–73. http://dx.doi.org/10.1007/s11590-014-0812-0.
Повний текст джерелаZhou, Jing, Cheng Lu, Ye Tian, and Xiaoying Tang. "A SOCP relaxation based branch-and-bound method for generalized trust-region subproblem." Journal of Industrial & Management Optimization 17, no. 1 (2021): 151–68. http://dx.doi.org/10.3934/jimo.2019104.
Повний текст джерелаJin, Qingwei, Shu-Cherng Fang, and Wenxun Xing. "On the global optimality of generalized trust region subproblems." Optimization 59, no. 8 (November 2010): 1139–51. http://dx.doi.org/10.1080/02331930902995236.
Повний текст джерелаJiang, Rujun, and Duan Li. "A Linear-Time Algorithm for Generalized Trust Region Subproblems." SIAM Journal on Optimization 30, no. 1 (January 2020): 915–32. http://dx.doi.org/10.1137/18m1215165.
Повний текст джерелаJiang, Rujun, Duan Li, and Baiyi Wu. "SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices." Mathematical Programming 169, no. 2 (April 18, 2017): 531–63. http://dx.doi.org/10.1007/s10107-017-1145-4.
Повний текст джерелаДисертації з теми "Generalized trust region subproblem"
Grodzevich, Oleg. "Regularization Using a Parameterized Trust Region Subproblem." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1159.
Повний текст джерелаFortin, Charles. "A survey of the trust region subproblem within a semidefinite framework." Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/1038.
Повний текст джерелаYang, Boshi. "A conic optimization approach to variants of the trust region subproblem." Diss., University of Iowa, 2015. https://ir.uiowa.edu/etd/1938.
Повний текст джерелаFortin, Charles. "Computing the local minimizers of a large and sparse trust-region subproblem." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=85548.
Повний текст джерелаBralic, Nikola. "Ethnic identity and generalized trust in heterogenous environments : A comparative study in the Gothenburg region." Thesis, Högskolan Väst, Avd för juridik, ekonomi, statistik och politik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-4432.
Повний текст джерелаLu, Zhaosong. "Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7151.
Повний текст джерелаYe, Heng. "Efficient Trust Region Subproblem Algorithms." Thesis, 2011. http://hdl.handle.net/10012/6297.
Повний текст джерелаWang, Zhen. "A generalized trust region SQP algorithm for equality constrained optimization." Thesis, 2004. http://hdl.handle.net/1911/18720.
Повний текст джерелаChen, Yen-Ting, and 陳彥廷. "Generalized Reduced Trust-region Search and Its Applications to Statistical Multi-Objective Optimization." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/15245552797594517046.
Повний текст джерела國立臺灣大學
工業工程學研究所
96
“Generalized Reduced Gradient” method is a popular NLP method, but it often incurs a zigzagging search path especially for the statistical multi-objective optimization (SMOO) problem where the objective function is a quartic function. In this study, we improve the “Trust Region (TR)” search method and develop the “Generalized Reduced Trust Region” (GRT) search method which combines the GRG method and the improved TR method. The GRT search transforms the constrained NLP problem to an unconstrained NLP problem consisting of only the nonbasic variables and searches the best improving direction in the reduced space. The proposed method is shown to overcome the zigzagging problem of the GRG method. To verify the performance of our methods, we study a well know test problem and three cases. The test problem is called Rosenbrock’s function which has a quartic objective function with two decision variables. The first case is a semiconductor design for manufacturing (DFM) problem. The second case is the problem to configure a robust semiconductor supply chain. The final case is the “Track System PEB CDU Optimization”. Compared against the result of the commercial software “Lingo”, the same or better solutions are obtained by our methods with comparable computation time.
Chen, Yen-Ting. "Generalized Reduced Trust-region Search and Its Applications to Statistical Multi-Objective Optimization." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2708200816423300.
Повний текст джерелаЧастини книг з теми "Generalized trust region subproblem"
Jiang, Rujun, and Duan Li. "On Conic Relaxations of Generalization of the Extended Trust Region Subproblem." In Advances in Intelligent Systems and Computing, 145–54. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-21803-4_15.
Повний текст джерелаAbsil, P. A., C. G. Baker, K. A. Gallivan, and A. Sameh. "Adaptive Model Trust Region Methods for Generalized Eigenvalue Problems." In Lecture Notes in Computer Science, 33–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11428831_5.
Повний текст джерелаBaker, C. G., P. A. Absil, and K. A. Gallivan. "An Implicit Riemannian Trust-Region Method for the Symmetric Generalized Eigenproblem." In Computational Science – ICCS 2006, 210–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11758501_32.
Повний текст джерела"7. The Trust-Region Subproblem." In Trust Region Methods, 169–248. Society for Industrial and Applied Mathematics, 2000. http://dx.doi.org/10.1137/1.9780898719857.ch7.
Повний текст джерелаBezena, Ivan. "MODERN MECHANISMS OF ANTI-CRISIS REGIONAL MANAGEMENT OF EDUCATION IN THE CONDITIONS OF REFORM." In Development of scientific, technological and innovation space in Ukraine and EU countries. Publishing House “Baltija Publishing”, 2021. http://dx.doi.org/10.30525/978-9934-26-151-0-22.
Повний текст джерелаТези доповідей конференцій з теми "Generalized trust region subproblem"
Bienstock, Daniel, and Alexander Michalka. "Polynomial Solvability of Variants of the Trust-Region Subproblem." In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973402.28.
Повний текст джерелаLu, H., G. Gao, H. Florez, J. Vink, C. Blom, T. Wells, and F. Saaf. "Solving Gauss-Newton Trust Region Subproblem with Bound Constraints." In ECMOR 2022. European Association of Geoscientists & Engineers, 2022. http://dx.doi.org/10.3997/2214-4609.202244007.
Повний текст джерелаHan, Jeongwoo, and Panos Papalambros. "A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35361.
Повний текст джерелаAlpak, Faruk, Yixuan Wang, Guohua Gao, and Vivek Jain. "Benchmarking and Field-Testing of the Distributed Quasi-Newton Derivative-Free Optimization Method for Field Development Optimization." In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/206267-ms.
Повний текст джерелаGao, Guohua, Horacio Florez, Sean Jost, Shakir Shaikh, Kefei Wang, Jeroen Vink, Carl Blom, Terence Wells, and Fredrik Saaf. "Implementation of Asynchronous Distributed Gauss-Newton Optimization Algorithms for Uncertainty Quantification by Conditioning to Production Data." In SPE Annual Technical Conference and Exhibition. SPE, 2022. http://dx.doi.org/10.2118/210118-ms.
Повний текст джерелаЗвіти організацій з теми "Generalized trust region subproblem"
Santos, Sandra A., and Danny C. Sorensen. A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem. Fort Belvoir, VA: Defense Technical Information Center, July 1995. http://dx.doi.org/10.21236/ada445632.
Повний текст джерелаBalza, Lenin, Lina M. Díaz, Nicolás Gómez Parra, and Osmel Manzano. The Unwritten License: The Social License to Operate in Latin America's Extractive Sector. Inter-American Development Bank, December 2021. http://dx.doi.org/10.18235/0003820.
Повний текст джерела