Curtis, Frank E.; Robinson, Daniel P.; Royer, Clément W.; Wright, Stephen J. Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization. (English) Zbl 07319273 SIAM J. Optim. 31, No. 1, 518-544 (2021). MSC: 90C26 49M05 49M15 65K05 90C60 PDF BibTeX XML Cite \textit{F. E. Curtis} et al., SIAM J. Optim. 31, No. 1, 518--544 (2021; Zbl 07319273) Full Text: DOI
Bellavia, Stefania; Gurioli, Gianmarco; Morini, Benedetta Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization. (English) Zbl 07315165 IMA J. Numer. Anal. 41, No. 1, 764-799 (2021). MSC: 65K10 PDF BibTeX XML Cite \textit{S. Bellavia} et al., IMA J. Numer. Anal. 41, No. 1, 764--799 (2021; Zbl 07315165) Full Text: DOI
O’Neill, Michael; Wright, Stephen J. A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees. (English) Zbl 07315147 IMA J. Numer. Anal. 41, No. 1, 84-121 (2021). MSC: 65 PDF BibTeX XML Cite \textit{M. O'Neill} and \textit{S. J. Wright}, IMA J. Numer. Anal. 41, No. 1, 84--121 (2021; Zbl 07315147) Full Text: DOI
Nesterov, Yurii Implementable tensor methods in unconstrained convex optimization. (English) Zbl 07310577 Math. Program. 186, No. 1-2 (A), 157-183 (2021). MSC: 90C25 90C06 65K05 PDF BibTeX XML Cite \textit{Y. Nesterov}, Math. Program. 186, No. 1--2 (A), 157--183 (2021; Zbl 07310577) Full Text: DOI
Ageev, Alexander; Kononov, Alexander A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem. (English) Zbl 07315666 Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-58656-0/pbk; 978-3-030-58657-7/ebook). Communications in Computer and Information Science 1275, 3-15 (2020). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{A. Ageev} and \textit{A. Kononov}, Commun. Comput. Inf. Sci. 1275, 3--15 (2020; Zbl 07315666) Full Text: DOI
Yang, Han; Yue, Jia; Huang, Nan-jing Multi-objective robust cross-market mixed portfolio optimization under hierarchical risk integration. (English) Zbl 1449.91136 J. Ind. Manag. Optim. 16, No. 2, 759-775 (2020). MSC: 91G10 91G60 91G70 PDF BibTeX XML Cite \textit{H. Yang} et al., J. Ind. Manag. Optim. 16, No. 2, 759--775 (2020; Zbl 1449.91136) Full Text: DOI
Barbarosie, Cristian; Toader, Anca-Maria; Lopes, Sérgio A gradient-type algorithm for constrained optimization with application to microstructure optimization. (English) Zbl 07195103 Discrete Contin. Dyn. Syst., Ser. B 25, No. 5, 1729-1755 (2020). MSC: 65K10 49M15 90C52 PDF BibTeX XML Cite \textit{C. Barbarosie} et al., Discrete Contin. Dyn. Syst., Ser. B 25, No. 5, 1729--1755 (2020; Zbl 07195103) Full Text: DOI
Shi, Yan; Lu, Zhenzhou; Huang, Zhiliang Time-dependent reliability-based design optimization with probabilistic and interval uncertainties. (English) Zbl 07193127 Appl. Math. Modelling 80, 268-289 (2020). MSC: 65 90 PDF BibTeX XML Cite \textit{Y. Shi} et al., Appl. Math. Modelling 80, 268--289 (2020; Zbl 07193127) Full Text: DOI
Park, Seonho; Jung, Seung Hyun; Pardalos, Panos M. Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization. (English) Zbl 1432.90096 J. Optim. Theory Appl. 184, No. 3, 953-971 (2020). MSC: 90C15 90C26 49M15 65K10 90C06 90C60 49M05 PDF BibTeX XML Cite \textit{S. Park} et al., J. Optim. Theory Appl. 184, No. 3, 953--971 (2020; Zbl 1432.90096) Full Text: DOI
Royer, Clément W.; O’Neill, Michael; Wright, Stephen J. A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. (English) Zbl 1448.90081 Math. Program. 180, No. 1-2 (A), 451-488 (2020). Reviewer: Ctirad Matonoha (Praha) MSC: 90C26 65K10 90C60 90C53 65F10 65F15 PDF BibTeX XML Cite \textit{C. W. Royer} et al., Math. Program. 180, No. 1--2 (A), 451--488 (2020; Zbl 1448.90081) Full Text: DOI
Birgin, E. G.; Krejić, N.; Martínez, J. M. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. (English) Zbl 07114226 Math. Comput. 89, No. 321, 253-278 (2020). MSC: 65K05 65K10 90C30 90C90 PDF BibTeX XML Cite \textit{E. G. Birgin} et al., Math. Comput. 89, No. 321, 253--278 (2020; Zbl 07114226) Full Text: DOI
Curtis, Frank E.; Robinson, Daniel P.; Samadi, Mohammadreza An inexact regularized Newton framework with a worst-case iteration complexity of \(\mathscr{O}(\varepsilon^{-3/2})\) for nonconvex optimization. (English) Zbl 07323650 IMA J. Numer. Anal. 39, No. 3, 1296-1327 (2019). MSC: 65 PDF BibTeX XML Cite \textit{F. E. Curtis} et al., IMA J. Numer. Anal. 39, No. 3, 1296--1327 (2019; Zbl 07323650) Full Text: DOI
Zhao, Yecheng; Zeng, Haibo The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems. (English) Zbl 1436.68076 Real-Time Syst. 55, No. 3, 667-707 (2019). MSC: 68M20 PDF BibTeX XML Cite \textit{Y. Zhao} and \textit{H. Zeng}, Real-Time Syst. 55, No. 3, 667--707 (2019; Zbl 1436.68076) Full Text: DOI
Kotov, Vladimir M.; Bogdanova, Natallia S. Bunch technique for semionline with two groups of items. (Russian. English summary) Zbl 1434.68694 Zh. Beloruss. Gos. Univ., Mat., Inform. 2019, No. 3, 134-138 (2019). MSC: 68W27 90B35 90C27 PDF BibTeX XML Cite \textit{V. M. Kotov} and \textit{N. S. Bogdanova}, Zh. Beloruss. Gos. Univ., Mat., Inform. 2019, No. 3, 134--138 (2019; Zbl 1434.68694) Full Text: Link
Cartis, Coralia; Roberts, Lindon A derivative-free Gauss-Newton method. (English) Zbl 07168037 Math. Program. Comput. 11, No. 4, 631-674 (2019). MSC: 65K05 90C30 90C56 PDF BibTeX XML Cite \textit{C. Cartis} and \textit{L. Roberts}, Math. Program. Comput. 11, No. 4, 631--674 (2019; Zbl 07168037) Full Text: DOI
Chen, Lihua; Korn, Ralf Worst-case portfolio optimization in discrete time. (English) Zbl 1431.91356 Math. Methods Oper. Res. 90, No. 2, 197-227 (2019). Reviewer: Yuliya S. Mishura (Kyïv) MSC: 91G10 91G80 90C39 91B16 PDF BibTeX XML Cite \textit{L. Chen} and \textit{R. Korn}, Math. Methods Oper. Res. 90, No. 2, 197--227 (2019; Zbl 1431.91356) Full Text: DOI
Fliege, J.; Vaz, A. I. F.; Vicente, L. N. Complexity of gradient descent for multiobjective optimization. (English) Zbl 1429.90067 Optim. Methods Softw. 34, No. 5, 949-959 (2019). MSC: 90C29 90C60 PDF BibTeX XML Cite \textit{J. Fliege} et al., Optim. Methods Softw. 34, No. 5, 949--959 (2019; Zbl 1429.90067) Full Text: DOI
Ji, Ying; Qu, Shaojian; Dai, Yeming A new approach for worst-case regret portfolio optimization problem. (English) Zbl 1422.37077 Discrete Contin. Dyn. Syst., Ser. S 12, No. 4-5, 761-770 (2019). MSC: 37N40 91G10 90C15 90C47 PDF BibTeX XML Cite \textit{Y. Ji} et al., Discrete Contin. Dyn. Syst., Ser. S 12, No. 4--5, 761--770 (2019; Zbl 1422.37077) Full Text: DOI
Gratton, S.; Royer, C. W.; Vicente, L. N.; Zhang, Z. Direct search based on probabilistic feasible descent for bound and linearly constrained problems. (English) Zbl 1420.90083 Comput. Optim. Appl. 72, No. 3, 525-559 (2019). MSC: 90C56 PDF BibTeX XML Cite \textit{S. Gratton} et al., Comput. Optim. Appl. 72, No. 3, 525--559 (2019; Zbl 1420.90083) Full Text: DOI
Bertazzi, Luca; Golden, Bruce; Wang, Xingyin The bin packing problem with item fragmentation: a worst-case analysis. (English) Zbl 1420.90057 Discrete Appl. Math. 261, 63-77 (2019). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{L. Bertazzi} et al., Discrete Appl. Math. 261, 63--77 (2019; Zbl 1420.90057) Full Text: DOI
Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization. (English) Zbl 1451.90177 Sirakov, Boyan (ed.) et al., Proceedings of the international congress of mathematicians 2018, ICM 2018, Rio de Janeiro, Brazil, August 1–9, 2018. Volume IV. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matemática (SBM). 3711-3750 (2018). MSC: 90C60 90C26 90C30 PDF BibTeX XML Cite \textit{C. Cartis} et al., in: Proceedings of the international congress of mathematicians 2018, ICM 2018, Rio de Janeiro, Brazil, August 1--9, 2018. Volume IV. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matemática (SBM). 3711--3750 (2018; Zbl 1451.90177) Full Text: DOI
Liu, JianTao; Gea, Hae Chang Robust topology optimization under multiple independent unknown-but-bounded loads. (English) Zbl 1439.74287 Comput. Methods Appl. Mech. Eng. 329, 464-479 (2018). MSC: 74P15 PDF BibTeX XML Cite \textit{J. Liu} and \textit{H. C. Gea}, Comput. Methods Appl. Mech. Eng. 329, 464--479 (2018; Zbl 1439.74287) Full Text: DOI
Bergou, El Houcine; Diouane, Youssef; Gratton, Serge A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis. (English) Zbl 1417.90097 J. Optim. Theory Appl. 178, No. 3, 885-913 (2018). MSC: 90C06 90C60 PDF BibTeX XML Cite \textit{E. H. Bergou} et al., J. Optim. Theory Appl. 178, No. 3, 885--913 (2018; Zbl 1417.90097) Full Text: DOI arXiv
Curtis, Frank E.; Lubberts, Zachary; Robinson, Daniel P. Concise complexity analyses for trust region methods. (English) Zbl 1412.90139 Optim. Lett. 12, No. 8, 1713-1724 (2018). MSC: 90C30 PDF BibTeX XML Cite \textit{F. E. Curtis} et al., Optim. Lett. 12, No. 8, 1713--1724 (2018; Zbl 1412.90139) Full Text: DOI arXiv
Paç, A. Burak; Pınar, Mustafa Ç. On robust portfolio and naïve diversification: mixing ambiguous and unambiguous assets. (English) Zbl 1417.91475 Ann. Oper. Res. 266, No. 1-2, 223-253 (2018). MSC: 91G10 91G70 PDF BibTeX XML Cite \textit{A. B. Paç} and \textit{M. Ç. Pınar}, Ann. Oper. Res. 266, No. 1--2, 223--253 (2018; Zbl 1417.91475) Full Text: DOI
Taylor, Adrien B.; Hendrickx, Julien M.; Glineur, François Exact worst-case convergence rates of the proximal gradient method for composite convex minimization. (English) Zbl 1394.90464 J. Optim. Theory Appl. 178, No. 2, 455-476 (2018). MSC: 90C25 90C22 90C20 PDF BibTeX XML Cite \textit{A. B. Taylor} et al., J. Optim. Theory Appl. 178, No. 2, 455--476 (2018; Zbl 1394.90464) Full Text: DOI arXiv
Berchio, Elvise; Buoso, Davide; Gazzola, Filippo; Zucco, Davide A minimaxmax problem for improving the torsional stability of rectangular plates. (English) Zbl 1392.35119 J. Optim. Theory Appl. 177, No. 1, 64-92 (2018). MSC: 35J40 35J35 74K20 PDF BibTeX XML Cite \textit{E. Berchio} et al., J. Optim. Theory Appl. 177, No. 1, 64--92 (2018; Zbl 1392.35119) Full Text: DOI
Curtis, Frank E.; Robinson, Daniel P.; Samadi, Mohammadreza Complexity analysis of a trust funnel algorithm for equality constrained optimization. (English) Zbl 1391.49056 SIAM J. Optim. 28, No. 2, 1533-1563 (2018). MSC: 49M15 49M37 65K05 65K10 65Y20 68Q25 90C30 90C60 PDF BibTeX XML Cite \textit{F. E. Curtis} et al., SIAM J. Optim. 28, No. 2, 1533--1563 (2018; Zbl 1391.49056) Full Text: DOI arXiv
Mokhtari, Aryan; Gürbüzbalaban, Mert; Ribeiro, Alejandro Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate. (English) Zbl 1390.90390 SIAM J. Optim. 28, No. 2, 1420-1447 (2018). MSC: 90C06 90C25 90C30 90C52 PDF BibTeX XML Cite \textit{A. Mokhtari} et al., SIAM J. Optim. 28, No. 2, 1420--1447 (2018; Zbl 1390.90390) Full Text: DOI arXiv
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich Competitive multi-agent scheduling with an iterative selection rule. (English) Zbl 1390.90321 4OR 16, No. 1, 15-29 (2018). MSC: 90B35 68M20 68Q25 91A06 PDF BibTeX XML Cite \textit{G. Nicosia} et al., 4OR 16, No. 1, 15--29 (2018; Zbl 1390.90321) Full Text: DOI
Böhm, Martin; Dósa, György; Epstein, Leah; Sgall, Jiří; Veselý, Pavel Colored bin packing: online algorithms and lower bounds. (English) Zbl 1386.68227 Algorithmica 80, No. 1, 155-184 (2018). MSC: 68W27 68W40 90C27 PDF BibTeX XML Cite \textit{M. Böhm} et al., Algorithmica 80, No. 1, 155--184 (2018; Zbl 1386.68227) Full Text: DOI
Côté, J. F.; Guastaroba, G.; Speranza, M. G. The value of integrating loading and routing. (English) Zbl 1394.90084 Eur. J. Oper. Res. 257, No. 1, 89-105 (2017). MSC: 90B06 90C27 90C59 90C57 PDF BibTeX XML Cite \textit{J. F. Côté} et al., Eur. J. Oper. Res. 257, No. 1, 89--105 (2017; Zbl 1394.90084) Full Text: DOI
Chen, Guangting; Zhang, Lei; Zhang, An; Chen, Yong Combinatorial approximation algorithms for Spectrum Assignment problem in chain and ring networks. (English) Zbl 06843482 Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part I. Cham: Springer (ISBN 978-3-319-71149-2/pbk; 978-3-319-71150-8/ebook). Lecture Notes in Computer Science 10627, 125-132 (2017). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{G. Chen} et al., Lect. Notes Comput. Sci. 10627, 125--132 (2017; Zbl 06843482) Full Text: DOI
Yang, Jie; Liao, Guisheng; Li, Jun; Lei, Yu; Wang, Xun Robust beamforming with imprecise array geometry using steering vector estimation and interference covariance matrix reconstruction. (English) Zbl 1383.78026 Multidimensional Syst. Signal Process. 28, No. 2, 451-469 (2017). MSC: 78A50 94A12 78M50 65F15 PDF BibTeX XML Cite \textit{J. Yang} et al., Multidimensional Syst. Signal Process. 28, No. 2, 451--469 (2017; Zbl 1383.78026) Full Text: DOI
Grapiglia, Geovani N.; Sachs, Ekkehard W. On the worst-case evaluation complexity of non-monotone line search algorithms. (English) Zbl 1388.90111 Comput. Optim. Appl. 68, No. 3, 555-577 (2017). MSC: 90C30 90C60 PDF BibTeX XML Cite \textit{G. N. Grapiglia} and \textit{E. W. Sachs}, Comput. Optim. Appl. 68, No. 3, 555--577 (2017; Zbl 1388.90111) Full Text: DOI
Wang, Zhenbo; Nip, Kameng Bin packing under linear constraints. (English) Zbl 1383.90035 J. Comb. Optim. 34, No. 4, 1198-1209 (2017). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{Z. Wang} and \textit{K. Nip}, J. Comb. Optim. 34, No. 4, 1198--1209 (2017; Zbl 1383.90035) Full Text: DOI
Jiang, Yiwei; Zhou, Ping; Wang, Huijuan; Hu, Jueliang Scheduling on two parallel machines with two dedicated servers. (English) Zbl 1373.90059 ANZIAM J. 58, No. 3-4, 314-323 (2017). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{Y. Jiang} et al., ANZIAM J. 58, No. 3--4, 314--323 (2017; Zbl 1373.90059) Full Text: DOI
Chambers, Erin; Erickson, Alejandro; Fekete, Sándor P.; Lenchner, Jonathan; Sember, Jeff; Srinivasan, Venkatesh; Stege, Ulrike; Stolpner, Svetlana; Weibel, Christophe; Whitesides, Sue Connectivity graphs of uncertainty regions. (English) Zbl 1372.68205 Algorithmica 78, No. 3, 990-1019 (2017). MSC: 68R10 68Q17 68Q25 68U05 68W25 90C35 PDF BibTeX XML Cite \textit{E. Chambers} et al., Algorithmica 78, No. 3, 990--1019 (2017; Zbl 1372.68205) Full Text: DOI
Taylor, Adrien B.; Hendrickx, Julien M.; Glineur, François Exact worst-case performance of first-order methods for composite convex optimization. (English) Zbl 1371.90108 SIAM J. Optim. 27, No. 3, 1283-1313 (2017). MSC: 90C25 90C30 90C60 68Q25 90C22 PDF BibTeX XML Cite \textit{A. B. Taylor} et al., SIAM J. Optim. 27, No. 3, 1283--1313 (2017; Zbl 1371.90108) Full Text: DOI arXiv
Caldentey, René; Liu, Ying; Lobel, Ilan Intertemporal pricing under minimax regret. (English) Zbl 1364.90354 Oper. Res. 65, No. 1, 104-129 (2017). MSC: 90C47 91G50 PDF BibTeX XML Cite \textit{R. Caldentey} et al., Oper. Res. 65, No. 1, 104--129 (2017; Zbl 1364.90354) Full Text: DOI
Wang, Xingyin; Poikonen, Stefan; Golden, Bruce The vehicle routing problem with drones: several worst-case results. (English) Zbl 1367.90012 Optim. Lett. 11, No. 4, 679-697 (2017). MSC: 90B06 90C27 PDF BibTeX XML Cite \textit{X. Wang} et al., Optim. Lett. 11, No. 4, 679--697 (2017; Zbl 1367.90012) Full Text: DOI
Curtis, Frank E.; Robinson, Daniel P.; Samadi, Mohammadreza A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization. (English) Zbl 1360.49020 Math. Program. 162, No. 1-2 (A), 1-32 (2017). MSC: 49M15 49M37 58C15 65K05 65K10 65Y20 68Q25 90C30 90C60 PDF BibTeX XML Cite \textit{F. E. Curtis} et al., Math. Program. 162, No. 1--2 (A), 1--32 (2017; Zbl 1360.49020) Full Text: DOI
Bellido, José Carlos; Buttazzo, Giuseppe; Velichkov, Bozhidar Worst-case shape optimization for the Dirichlet energy. (English) Zbl 1358.49013 Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 153, 117-129 (2017). MSC: 49J45 49R05 35P15 47A75 35J25 PDF BibTeX XML Cite \textit{J. C. Bellido} et al., Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 153, 117--129 (2017; Zbl 1358.49013) Full Text: DOI
Cartis, C.; Gould, N. I. M.; Toint, Ph. L. Corrigendum to: “On the complexity of finding first-order critical points in constrained nonlinear optimization”. (English) Zbl 06680644 Math. Program. 161, No. 1-2 (A), 611-626 (2017). MSC: 90C PDF BibTeX XML Cite \textit{C. Cartis} et al., Math. Program. 161, No. 1--2 (A), 611--626 (2017; Zbl 06680644) Full Text: DOI
Kerkkamp, R. B. O.; Aardal, K. A constructive proof of swap local search worst-case instances for the maximum coverage problem. (English) Zbl 1408.90163 Oper. Res. Lett. 44, No. 3, 329-335 (2016). MSC: 90B80 90C27 PDF BibTeX XML Cite \textit{R. B. O. Kerkkamp} and \textit{K. Aardal}, Oper. Res. Lett. 44, No. 3, 329--335 (2016; Zbl 1408.90163) Full Text: DOI
Balogh, János; Békési, József; Galambos, Gábor; Dósa, György; Tan, Zhiyi Lower bound for 3-batched bin packing. (English) Zbl 1387.90205 Discrete Optim. 21, 14-24 (2016). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{J. Balogh} et al., Discrete Optim. 21, 14--24 (2016; Zbl 1387.90205) Full Text: DOI
Grapiglia, Geovani Nunes; Yuan, Jinyun; Yuan, Ya-xiang A derivative-free trust-region algorithm for composite nonsmooth optimization. (English) Zbl 1371.49014 Comput. Appl. Math. 35, No. 2, 475-499 (2016). MSC: 49J53 90C30 58C15 49M37 90C56 68Q25 65K05 49J52 PDF BibTeX XML Cite \textit{G. N. Grapiglia} et al., Comput. Appl. Math. 35, No. 2, 475--499 (2016; Zbl 1371.49014) Full Text: DOI
Grapiglia, Geovani Nunes; Yuan, Jinyun; Yuan, Ya-xiang Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality. (English) Zbl 1354.90138 J. Optim. Theory Appl. 171, No. 3, 980-997 (2016). MSC: 90C30 65K05 49M37 49M15 90C29 90C60 68Q25 PDF BibTeX XML Cite \textit{G. N. Grapiglia} et al., J. Optim. Theory Appl. 171, No. 3, 980--997 (2016; Zbl 1354.90138) Full Text: DOI
He, Cheng; Leung, Joseph Y-T.; Lee, Kangbok; Pinedo, Michael L. An improved binary search algorithm for the multiple-choice knapsack problem. (English) Zbl 1401.90191 RAIRO, Oper. Res. 50, No. 4-5, 995-1001 (2016). MSC: 90C27 68Q25 90C10 90C59 PDF BibTeX XML Cite \textit{C. He} et al., RAIRO, Oper. Res. 50, No. 4--5, 995--1001 (2016; Zbl 1401.90191) Full Text: DOI
Garmanjani, R.; Júdice, D.; Vicente, L. N. Trust-region methods without using derivatives: worst case complexity and the nonsmooth case. (English) Zbl 1348.90572 SIAM J. Optim. 26, No. 4, 1987-2011 (2016). MSC: 90C30 90C56 PDF BibTeX XML Cite \textit{R. Garmanjani} et al., SIAM J. Optim. 26, No. 4, 1987--2011 (2016; Zbl 1348.90572) Full Text: DOI
Liu, Ya-Feng; Ma, Shiqian; Dai, Yu-Hong; Zhang, Shuzhong A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron. (English) Zbl 1346.90684 Math. Program. 158, No. 1-2 (A), 467-500 (2016). MSC: 90C26 90C30 90C46 65K05 PDF BibTeX XML Cite \textit{Y.-F. Liu} et al., Math. Program. 158, No. 1--2 (A), 467--500 (2016; Zbl 1346.90684) Full Text: DOI arXiv
Sniedovich, Moshe Wald’s mighty maximin: a tutorial. (English) Zbl 1415.91098 Int. Trans. Oper. Res. 23, No. 4, 625-653 (2016). MSC: 91B06 90C31 PDF BibTeX XML Cite \textit{M. Sniedovich}, Int. Trans. Oper. Res. 23, No. 4, 625--653 (2016; Zbl 1415.91098) Full Text: DOI
Grapiglia, G. N.; Yuan, J.; Yuan, Y. On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization. (English) Zbl 1350.90032 Optim. Methods Softw. 31, No. 3, 591-604 (2016). MSC: 90C30 65K05 49M37 49M15 90C29 PDF BibTeX XML Cite \textit{G. N. Grapiglia} et al., Optim. Methods Softw. 31, No. 3, 591--604 (2016; Zbl 1350.90032) Full Text: DOI
Gratton, S.; Royer, C. W.; Vicente, L. N. A second-order globally convergent direct-search method and its worst-case complexity. (English) Zbl 1338.90463 Optimization 65, No. 6, 1105-1128 (2016). MSC: 90C56 90C60 49M05 PDF BibTeX XML Cite \textit{S. Gratton} et al., Optimization 65, No. 6, 1105--1128 (2016; Zbl 1338.90463) Full Text: DOI
Marzat, Julien; Walter, Eric; Piet-Lahanier, Hélène A new expected-improvement algorithm for continuous minimax optimization. (English) Zbl 1345.90105 J. Glob. Optim. 64, No. 4, 785-802 (2016). MSC: 90C47 PDF BibTeX XML Cite \textit{J. Marzat} et al., J. Glob. Optim. 64, No. 4, 785--802 (2016; Zbl 1345.90105) Full Text: DOI
Dong, Jianming; Wang, Xueshi; Hu, Jueliang; Lin, Guohui An improved two-machine flowshop scheduling with intermediate transportation. (English) Zbl 1343.90033 J. Comb. Optim. 31, No. 3, 1316-1334 (2016). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{J. Dong} et al., J. Comb. Optim. 31, No. 3, 1316--1334 (2016; Zbl 1343.90033) Full Text: DOI
Backhoff Veraguas, Julio D.; Fontbona, Joaquín Robust utility maximization without model compactness. (English) Zbl 1368.91163 SIAM J. Financ. Math. 7, 70-103 (2016). MSC: 91G10 91G80 49N15 46E30 PDF BibTeX XML Cite \textit{J. D. Backhoff Veraguas} and \textit{J. Fontbona}, SIAM J. Financ. Math. 7, 70--103 (2016; Zbl 1368.91163) Full Text: DOI
Apkarian, Pierre; Noll, Dominikus; Ravanbod, Laleh Nonsmooth bundle trust-region algorithm with applications to robust stability. (English) Zbl 1334.49092 Set-Valued Var. Anal. 24, No. 1, 115-148 (2016). MSC: 49M30 49J52 90C26 93D09 93B60 93B36 PDF BibTeX XML Cite \textit{P. Apkarian} et al., Set-Valued Var. Anal. 24, No. 1, 115--148 (2016; Zbl 1334.49092) Full Text: DOI
Dodangeh, M.; Vicente, L. N. Worst case complexity of direct search under convexity. (English) Zbl 1338.90462 Math. Program. 155, No. 1-2 (A), 307-332 (2016). Reviewer: Nada Djuranović-Miličić (Belgrade) MSC: 90C56 90C25 90C30 PDF BibTeX XML Cite \textit{M. Dodangeh} and \textit{L. N. Vicente}, Math. Program. 155, No. 1--2 (A), 307--332 (2016; Zbl 1338.90462) Full Text: DOI
Nesterov, Yu.; Tunçel, L. Local superlinear convergence of polynomial-time interior-point methods for hyperbolicity cone optimization problems. (English) Zbl 1329.90168 SIAM J. Optim. 26, No. 1, 139-170 (2016). MSC: 90C51 52A41 90C22 90C25 PDF BibTeX XML Cite \textit{Yu. Nesterov} and \textit{L. Tunçel}, SIAM J. Optim. 26, No. 1, 139--170 (2016; Zbl 1329.90168) Full Text: DOI
Belak, Christoph; Menkens, Olaf; Sass, Jörn Worst-case portfolio optimization with proportional transaction costs. (English) Zbl 1414.91329 Stochastics 87, No. 4, 623-663 (2015). MSC: 91G10 91A15 90C39 93E20 PDF BibTeX XML Cite \textit{C. Belak} et al., Stochastics 87, No. 4, 623--663 (2015; Zbl 1414.91329) Full Text: DOI
Bian, Wei; Chen, Xiaojun Linearly constrained non-Lipschitz optimization for image restoration. (English) Zbl 1327.90299 SIAM J. Imaging Sci. 8, No. 4, 2294-2322 (2015). MSC: 90C30 90C26 65K05 49M37 PDF BibTeX XML Cite \textit{W. Bian} and \textit{X. Chen}, SIAM J. Imaging Sci. 8, No. 4, 2294--2322 (2015; Zbl 1327.90299) Full Text: DOI
Simchi-Levi, David; Wei, Yehua Worst-case analysis of process flexibility designs. (English) Zbl 1377.90022 Oper. Res. 63, No. 1, 166-185 (2015). MSC: 90B30 PDF BibTeX XML Cite \textit{D. Simchi-Levi} and \textit{Y. Wei}, Oper. Res. 63, No. 1, 166--185 (2015; Zbl 1377.90022) Full Text: DOI
Huang, Liqin; Tong, Weitian; Goebel, Randy; Liu, Tian; Lin, Guohui A 0.5358-approximation for Bandpass-2. (English) Zbl 1331.90069 J. Comb. Optim. 30, No. 3, 612-626 (2015). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{L. Huang} et al., J. Comb. Optim. 30, No. 3, 612--626 (2015; Zbl 1331.90069) Full Text: DOI
Peng, Jiming; Zhu, Tao A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties. (English) Zbl 1327.90106 Math. Program. 152, No. 1-2 (A), 593-614 (2015). MSC: 90C05 90C22 90C26 90C47 PDF BibTeX XML Cite \textit{J. Peng} and \textit{T. Zhu}, Math. Program. 152, No. 1--2 (A), 593--614 (2015; Zbl 1327.90106) Full Text: DOI
Grapiglia, Geovani N.; Yuan, Jinyun; Yuan, Ya-xiang On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. (English) Zbl 1319.90065 Math. Program. 152, No. 1-2 (A), 491-520 (2015). MSC: 90C30 65K05 49M37 49M15 90C29 90C60 68Q25 PDF BibTeX XML Cite \textit{G. N. Grapiglia} et al., Math. Program. 152, No. 1--2 (A), 491--520 (2015; Zbl 1319.90065) Full Text: DOI
Desmettre, Sascha; Korn, Ralf; Ruckdeschel, Peter; Seifried, Frank Thomas Robust worst-case optimal investment. (English) Zbl 1317.93269 OR Spectrum 37, No. 3, 677-701 (2015). MSC: 93E20 91G10 62C20 62P05 PDF BibTeX XML Cite \textit{S. Desmettre} et al., OR Spectrum 37, No. 3, 677--701 (2015; Zbl 1317.93269) Full Text: DOI
Gu, Mengyang; Tan, Zhiyi; Xia, Binzhou; Yan, Yujie A new approach for bicriteria partitioning problem. (English) Zbl 1351.90140 Optim. Lett. 9, No. 5, 1025-1037 (2015). MSC: 90C27 90C29 90B35 PDF BibTeX XML Cite \textit{M. Gu} et al., Optim. Lett. 9, No. 5, 1025--1037 (2015; Zbl 1351.90140) Full Text: DOI
Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods. (English) Zbl 1329.65124 SIAM J. Numer. Anal. 53, No. 2, 836-851 (2015). MSC: 65K05 68Q25 90C26 90C30 90C60 PDF BibTeX XML Cite \textit{C. Cartis} et al., SIAM J. Numer. Anal. 53, No. 2, 836--851 (2015; Zbl 1329.65124) Full Text: DOI
Cartis, C.; Sampaio, Ph. R.; Toint, Ph. L. Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization. (English) Zbl 1342.90180 Optimization 64, No. 5, 1349-1361 (2015). MSC: 90C30 90C60 PDF BibTeX XML Cite \textit{C. Cartis} et al., Optimization 64, No. 5, 1349--1361 (2015; Zbl 1342.90180) Full Text: DOI
Bianconcini, Tommaso; Liuzzi, Giampaolo; Morini, Benedetta; Sciandrone, Marco On the use of iterative methods in cubic regularization for unconstrained optimization. (English) Zbl 1308.90166 Comput. Optim. Appl. 60, No. 1, 35-57 (2015). MSC: 90C30 PDF BibTeX XML Cite \textit{T. Bianconcini} et al., Comput. Optim. Appl. 60, No. 1, 35--57 (2015; Zbl 1308.90166) Full Text: DOI
Popovici, Elena; Winston, Ezra A framework for co-optimization algorithm performance and its application to worst-case optimization. (English) Zbl 1314.68295 Theor. Comput. Sci. 567, 46-73 (2015). MSC: 68T20 90C59 PDF BibTeX XML Cite \textit{E. Popovici} and \textit{E. Winston}, Theor. Comput. Sci. 567, 46--73 (2015; Zbl 1314.68295) Full Text: DOI
Luo, Guimei Worst-case VaR in financial risk measure and portfolio optimization. (Chinese. English summary) Zbl 1340.91114 Math. Pract. Theory 44, No. 5, 15-20 (2014). MSC: 91G10 91G70 PDF BibTeX XML Cite \textit{G. Luo}, Math. Pract. Theory 44, No. 5, 15--20 (2014; Zbl 1340.91114)
Dokka, Trivikram; Crama, Yves; Spieksma, Frits C. R. Multi-dimensional vector assignment problems. (English) Zbl 1308.90088 Discrete Optim. 14, 111-125 (2014). MSC: 90B80 90C59 90C27 PDF BibTeX XML Cite \textit{T. Dokka} et al., Discrete Optim. 14, 111--125 (2014; Zbl 1308.90088) Full Text: DOI
Jiang, Yiwei; Hu, Jueliang; Weng, Zewei; Zhu, Yuqing Parallel machine covering with limited number of preemptions. (English) Zbl 1313.90088 Appl. Math., Ser. B (Engl. Ed.) 29, No. 1, 18-28 (2014). MSC: 90B35 90C27 68Q25 PDF BibTeX XML Cite \textit{Y. Jiang} et al., Appl. Math., Ser. B (Engl. Ed.) 29, No. 1, 18--28 (2014; Zbl 1313.90088) Full Text: DOI
Allaire, Grégoire; Dapogny, Charles A linearized approach to worst-case design in parametric and geometric shape optimization. (English) Zbl 1297.49075 Math. Models Methods Appl. Sci. 24, No. 11, 2199-2257 (2014). MSC: 49Q10 49J20 65K05 74P20 90C90 PDF BibTeX XML Cite \textit{G. Allaire} and \textit{C. Dapogny}, Math. Models Methods Appl. Sci. 24, No. 11, 2199--2257 (2014; Zbl 1297.49075) Full Text: DOI
Peyghami, M. Reza; Hafshejani, S. Fathi Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function. (English) Zbl 1300.65042 Numer. Algorithms 67, No. 1, 33-48 (2014). Reviewer: Hang Lau (Montréal) MSC: 65K05 90C05 90C51 90C60 PDF BibTeX XML Cite \textit{M. R. Peyghami} and \textit{S. F. Hafshejani}, Numer. Algorithms 67, No. 1, 33--48 (2014; Zbl 1300.65042) Full Text: DOI
Pham, Khanh D. Resilient controls for ordering uncertain prospects. Change and response. (English) Zbl 1297.93003 Springer Optimization and Its Applications 98. Cham: Springer (ISBN 978-3-319-08704-7/hbk; 978-3-319-08705-4/ebook). xiv, 211 p. (2014). MSC: 93-02 49-02 93E20 49N90 PDF BibTeX XML Cite \textit{K. D. Pham}, Resilient controls for ordering uncertain prospects. Change and response. Cham: Springer (2014; Zbl 1297.93003) Full Text: DOI
Kim, Jang Ho; Kim, Woo Chang; Fabozzi, Frank J. Recent developments in robust portfolios with a worst-case approach. (English) Zbl 1300.91045 J. Optim. Theory Appl. 161, No. 1, 103-121 (2014). MSC: 91G10 PDF BibTeX XML Cite \textit{J. H. Kim} et al., J. Optim. Theory Appl. 161, No. 1, 103--121 (2014; Zbl 1300.91045) Full Text: DOI
Belak, Christoph; Christensen, Sören; Menkens, Olaf Worst-case optimal investment with a random number of crashes. (English) Zbl 1303.91151 Stat. Probab. Lett. 90, 140-148 (2014). Reviewer: Aleksandr D. Borisenko (Kyïv) MSC: 91G10 60H10 60G40 PDF BibTeX XML Cite \textit{C. Belak} et al., Stat. Probab. Lett. 90, 140--148 (2014; Zbl 1303.91151) Full Text: DOI
Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. On the complexity of finding first-order critical points in constrained nonlinear optimization. (English) Zbl 1301.68154 Math. Program. 144, No. 1-2 (A), 93-106 (2014). MSC: 68Q25 90C60 90C30 PDF BibTeX XML Cite \textit{C. Cartis} et al., Math. Program. 144, No. 1--2 (A), 93--106 (2014; Zbl 1301.68154) Full Text: DOI
Balogh, János; Békési, József; Galambos, Gábor; Reinelt, Gerhard On-line bin packing with restricted repacking. (English) Zbl 1286.90120 J. Comb. Optim. 27, No. 1, 115-131 (2014). MSC: 90C27 PDF BibTeX XML Cite \textit{J. Balogh} et al., J. Comb. Optim. 27, No. 1, 115--131 (2014; Zbl 1286.90120) Full Text: DOI
Vicente, L. N. Worst case complexity of direct search. (English) Zbl 1304.90198 EURO J. Comput. Optim. 1, No. 1-2, 143-153 (2013). MSC: 90C30 90C56 PDF BibTeX XML Cite \textit{L. N. Vicente}, EURO J. Comput. Optim. 1, No. 1--2, 143--153 (2013; Zbl 1304.90198) Full Text: DOI
Monaci, Michele; Pferschy, Ulrich On the robust knapsack problem. (English) Zbl 1306.90134 SIAM J. Optim. 23, No. 4, 1956-1982 (2013). Reviewer: Reinhardt Euler (Brest) MSC: 90C27 90C09 90C59 PDF BibTeX XML Cite \textit{M. Monaci} and \textit{U. Pferschy}, SIAM J. Optim. 23, No. 4, 1956--1982 (2013; Zbl 1306.90134) Full Text: DOI
Wong, Man Hong; Zhang, Shuzhong Computing best bounds for nonlinear risk measures with partial information. (English) Zbl 1284.91278 Insur. Math. Econ. 52, No. 2, 204-212 (2013). MSC: 91B30 60E05 62P05 90C22 PDF BibTeX XML Cite \textit{M. H. Wong} and \textit{S. Zhang}, Insur. Math. Econ. 52, No. 2, 204--212 (2013; Zbl 1284.91278) Full Text: DOI
Zhang, Hongjie; Bai, Yanqin; Fang, Chunliang A linear conic optimization model for robust credit risk optimization. (English) Zbl 1299.91163 Oper. Res. Trans. 17, No. 1, 86-97 (2013). MSC: 91G40 90C05 90C25 PDF BibTeX XML Cite \textit{H. Zhang} et al., Oper. Res. Trans. 17, No. 1, 86--97 (2013; Zbl 1299.91163)
Laforest, Christian; Phan, Raksmey Solving the minimum independent domination set problem in graphs by exact algorithm and greedy heuristic. (English) Zbl 1282.05180 RAIRO, Oper. Res. 47, No. 3, 199-221 (2013). MSC: 05C69 05C85 90C27 90C59 PDF BibTeX XML Cite \textit{C. Laforest} and \textit{R. Phan}, RAIRO, Oper. Res. 47, No. 3, 199--221 (2013; Zbl 1282.05180) Full Text: DOI
Bian, Wei; Chen, Xiaojun Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. (English) Zbl 1282.90175 SIAM J. Optim. 23, No. 3, 1718-1741 (2013). MSC: 90C30 90C26 65K05 49M37 PDF BibTeX XML Cite \textit{W. Bian} and \textit{X. Chen}, SIAM J. Optim. 23, No. 3, 1718--1741 (2013; Zbl 1282.90175) Full Text: DOI
Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization. (English) Zbl 1277.68092 SIAM J. Optim. 23, No. 3, 1553-1574 (2013). MSC: 68Q25 90C60 90C30 90C26 65K05 PDF BibTeX XML Cite \textit{C. Cartis} et al., SIAM J. Optim. 23, No. 3, 1553--1574 (2013; Zbl 1277.68092) Full Text: DOI
Panchamgam, Kiran; Xiong, Yupei; Golden, Bruce; Dussault, Benjamin; Wasil, Edward The hierarchical traveling salesman problem. (English) Zbl 1280.90101 Optim. Lett. 7, No. 7, 1517-1524 (2013). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{K. Panchamgam} et al., Optim. Lett. 7, No. 7, 1517--1524 (2013; Zbl 1280.90101) Full Text: DOI
Lassila, Toni; Manzoni, Andrea; Quarteroni, Alfio; Rozza, Gianluigi Boundary control and shape optimization for the robust design of bypass anastomoses under uncertainty. (English) Zbl 1402.92246 ESAIM, Math. Model. Numer. Anal. 47, No. 4, 1107-1131 (2013). MSC: 92C50 35Q92 92C35 PDF BibTeX XML Cite \textit{T. Lassila} et al., ESAIM, Math. Model. Numer. Anal. 47, No. 4, 1107--1131 (2013; Zbl 1402.92246) Full Text: DOI
Garmanjani, R.; Vicente, L. N. Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. (English) Zbl 1272.65050 IMA J. Numer. Anal. 33, No. 3, 1008-1028 (2013). MSC: 65K05 65Y20 90C30 PDF BibTeX XML Cite \textit{R. Garmanjani} and \textit{L. N. Vicente}, IMA J. Numer. Anal. 33, No. 3, 1008--1028 (2013; Zbl 1272.65050) Full Text: DOI
Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. A note about the complexity of minimizing Nesterov’s smooth Chebyshev-Rosenbrock function. (English) Zbl 1273.90199 Optim. Methods Softw. 28, No. 3, 451-457 (2013). MSC: 90C30 65K05 90C60 68Q25 PDF BibTeX XML Cite \textit{C. Cartis} et al., Optim. Methods Softw. 28, No. 3, 451--457 (2013; Zbl 1273.90199) Full Text: DOI
Marzat, Julien; Walter, Eric; Piet-Lahanier, Hélène Worst-case global optimization of black-box functions through Kriging and relaxation. (English) Zbl 1268.90054 J. Glob. Optim. 55, No. 4, 707-727 (2013). MSC: 90C26 90C47 PDF BibTeX XML Cite \textit{J. Marzat} et al., J. Glob. Optim. 55, No. 4, 707--727 (2013; Zbl 1268.90054) Full Text: DOI
Wang, Zhenbo Worst-case performance of the successive approximation algorithm for four identical knapsacks. (English) Zbl 1291.68443 J. Ind. Manag. Optim. 8, No. 3, 651-656 (2012). MSC: 68W40 68W25 90C27 PDF BibTeX XML Cite \textit{Z. Wang}, J. Ind. Manag. Optim. 8, No. 3, 651--656 (2012; Zbl 1291.68443) Full Text: DOI
Bodlaender, Hans L.; Schuurman, Petra; Woeginger, Gerhard J. Scheduling of pipelined operator graphs. (English) Zbl 1280.68084 J. Sched. 15, No. 3, 323-332 (2012). MSC: 68P15 68R10 68W25 68M20 90B35 PDF BibTeX XML Cite \textit{H. L. Bodlaender} et al., J. Sched. 15, No. 3, 323--332 (2012; Zbl 1280.68084) Full Text: DOI
Harren, Rolf; van Stee, Rob Absolute approximation ratios for packing rectangles into bins. (English) Zbl 1280.68295 J. Sched. 15, No. 1, 63-75 (2012). MSC: 68W25 05C85 90C27 90B80 PDF BibTeX XML Cite \textit{R. Harren} and \textit{R. van Stee}, J. Sched. 15, No. 1, 63--75 (2012; Zbl 1280.68295) Full Text: DOI
Choi, Bo Kyung; Lee, Gue Myung New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems. (English) Zbl 1277.90147 Fixed Point Theory Appl. 2012, Paper No. 213, 22 p. (2012). MSC: 90C51 90C25 65K05 PDF BibTeX XML Cite \textit{B. K. Choi} and \textit{G. M. Lee}, Fixed Point Theory Appl. 2012, Paper No. 213, 22 p. (2012; Zbl 1277.90147) Full Text: DOI
Ohsaki, Makoto; Katsura, Masahiko A random sampling approach to worst-case design of structures. (English) Zbl 1274.90390 Struct. Multidiscip. Optim. 46, No. 1, 27-39 (2012). MSC: 90C30 74P99 90C15 62P30 PDF BibTeX XML Cite \textit{M. Ohsaki} and \textit{M. Katsura}, Struct. Multidiscip. Optim. 46, No. 1, 27--39 (2012; Zbl 1274.90390) Full Text: DOI
Korn, Ralf; Menkens, Olaf; Steffensen, Mogens Worst-case-optimal dynamic reinsurance for large claims. (English) Zbl 1269.91044 Eur. Actuar. J. 2, No. 1, 21-48 (2012). MSC: 91B30 PDF BibTeX XML Cite \textit{R. Korn} et al., Eur. Actuar. J. 2, No. 1, 21--48 (2012; Zbl 1269.91044) Full Text: DOI