A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-016-1024-9
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Wanyou Cheng & Donghui Li, 2012. "An Active Set Modified Polak–Ribiére–Polyak Method for Large-Scale Nonlinear Bound Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 1084-1094, December.
- A. Schwartz & E. Polak, 1997. "Family of Projected Descent Methods for Optimization Problems with Simple Bounds," Journal of Optimization Theory and Applications, Springer, vol. 92(1), pages 1-31, January.
- Nicholas Gould & Dominique Orban & Philippe Toint, 2015. "CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization," Computational Optimization and Applications, Springer, vol. 60(3), pages 545-557, April.
- M. Santis & G. Pillo & S. Lucidi, 2012. "An active set feasible method for large-scale minimization problems with bound constraints," Computational Optimization and Applications, Springer, vol. 53(2), pages 395-423, October.
- Ernesto Birgin & Jan Gentil, 2012. "Evaluating bound-constrained minimization software," Computational Optimization and Applications, Springer, vol. 53(2), pages 347-373, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2022. "Minimization over the $$\ell _1$$ ℓ 1 -ball using an active-set non-monotone projected gradient," Computational Optimization and Applications, Springer, vol. 83(2), pages 693-721, November.
- Cristofari, Andrea, 2023. "A decomposition method for lasso problems with zero-sum constraint," European Journal of Operational Research, Elsevier, vol. 306(1), pages 358-369.
- Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2020. "An active-set algorithmic framework for non-convex optimization problems over the simplex," Computational Optimization and Applications, Springer, vol. 77(1), pages 57-89, September.
- Enrico Bettiol & Lucas Létocart & Francesco Rinaldi & Emiliano Traversi, 2020. "A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs," Computational Optimization and Applications, Springer, vol. 75(2), pages 321-360, March.
- Andrea Cristofari & Gianni Di Pillo & Giampaolo Liuzzi & Stefano Lucidi, 2022. "An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 300-323, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- David Ek & Anders Forsgren, 2021. "Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization," Computational Optimization and Applications, Springer, vol. 79(1), pages 155-191, May.
- Andrea Cristofari & Gianni Di Pillo & Giampaolo Liuzzi & Stefano Lucidi, 2022. "An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 300-323, June.
- Matteo Lapucci & Alessio Sortino, 2024. "On the Convergence of Inexact Alternate Minimization in Problems with $$\ell _0$$ ℓ 0 Penalties," SN Operations Research Forum, Springer, vol. 5(2), pages 1-11, June.
- Yutao Zheng & Bing Zheng, 2017. "Two New Dai–Liao-Type Conjugate Gradient Methods for Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 502-509, November.
- Giovanni Fasano & Massimo Roma, 2016. "A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 399-429, November.
- Yonggang Pei & Shaofang Song & Detong Zhu, 2023. "A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization," Computational Optimization and Applications, Springer, vol. 84(3), pages 1005-1033, April.
- Enrico Bettiol & Lucas Létocart & Francesco Rinaldi & Emiliano Traversi, 2020. "A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs," Computational Optimization and Applications, Springer, vol. 75(2), pages 321-360, March.
- Mehiddin Al-Baali & Andrea Caliciotti & Giovanni Fasano & Massimo Roma, 2017.
"Exploiting damped techniques for nonlinear conjugate gradient methods,"
Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 501-522, December.
- Mehiddin Al-Baali & Andrea Caliciotti & Giovanni Fasano & Massimo Roma, 2017. "Exploiting damped techniques for nonlinear conjugate gradient methods," DIAG Technical Reports 2017-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- XiaoLiang Dong & Deren Han & Zhifeng Dai & Lixiang Li & Jianguang Zhu, 2018. "An Accelerated Three-Term Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 944-961, December.
- Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2020. "An active-set algorithmic framework for non-convex optimization problems over the simplex," Computational Optimization and Applications, Springer, vol. 77(1), pages 57-89, September.
- Nicholas I. M. Gould & Daniel P. Robinson, 2017. "A dual gradient-projection method for large-scale strictly convex quadratic problems," Computational Optimization and Applications, Springer, vol. 67(1), pages 1-38, May.
- Charles Audet & Kwassi Joseph Dzahini & Michael Kokkolaras & Sébastien Le Digabel, 2021. "Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates," Computational Optimization and Applications, Springer, vol. 79(1), pages 1-34, May.
- Caliciotti, Andrea & Fasano, Giovanni & Roma, Massimo, 2018. "Preconditioned Nonlinear Conjugate Gradient methods based on a modified secant equation," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 196-214.
- Hoai Le Thi & Van Huynh & Tao Dinh & A. Vaz & L. Vicente, 2014. "Globally convergent DC trust-region methods," Journal of Global Optimization, Springer, vol. 59(2), pages 209-225, July.
- Jianjun Liu & Xiangmin Xu & Xuehui Cui, 2018. "An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 69(1), pages 77-97, January.
- Rujun Jiang & Man-Chung Yue & Zhishuo Zhou, 2021. "An accelerated first-order method with complexity analysis for solving cubic regularization subproblems," Computational Optimization and Applications, Springer, vol. 79(2), pages 471-506, June.
- N.H. Xiu & J.Z. Zhang, 2002. "Local Convergence Analysis of Projection-Type Algorithms: Unified Approach," Journal of Optimization Theory and Applications, Springer, vol. 115(1), pages 211-230, October.
- Adriano Verdério & Elizabeth W. Karas & Lucas G. Pedroso & Katya Scheinberg, 2017. "On the construction of quadratic models for derivative-free trust-region algorithms," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 501-527, December.
- Denis Becker & Alexei Gaivoronski, 2014. "Stochastic optimization on social networks with application to service pricing," Computational Management Science, Springer, vol. 11(4), pages 531-562, October.
- S. Gratton & C. W. Royer & L. N. Vicente & Z. Zhang, 2019. "Direct search based on probabilistic feasible descent for bound and linearly constrained problems," Computational Optimization and Applications, Springer, vol. 72(3), pages 525-559, April.
More about this item
Keywords
Bound-constrained optimization; Large-scale optimization; Active-set methods; Non-monotone stabilization techniques;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:172:y:2017:i:2:d:10.1007_s10957-016-1024-9. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.