Inexact variable metric method for convex-constrained optimization problems

References

• Birgin EG, Martínez JM, Raydan M. Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim. 2000;10:1196–1211.
   Web of Science ®Google Scholar
• Grippo L, Lampariello F, Lucidi S. A nonmonotone line search technique for Newton's method. SIAM J Numer Anal. 1986;23(4):707–716.
   Web of Science ®Google Scholar
• Barzilai J, Borwein JM. Two-point step size gradient methods. IMA J Numer Anal. 1988;8(1):141–148.
   Web of Science ®Google Scholar
• Andretta M, Birgin EG, Martínez JM. Partial spectral projected gradient method with active-set strategy for linearly constrained optimization. Numer Algorithms. 2009;53:23–52.
   Web of Science ®Google Scholar
• Birgin EG, Martínez JM, Raydan M. Algorithm 813: SPG – software for convex-constrained optimization. ACM Trans Math Softw. 2001;27:3340–349.
   Web of Science ®Google Scholar
• Birgin EG, Martínez JM, Raydan M. Spectral projected gradient methods: review and perspectives. J Stat Softw. 2014;60(3):1–21.
   Web of Science ®Google Scholar
• Cores D, Escalante R, González-Lima M, et al. On the use of the spectral projected gradient method for support vector machines. J Comput Appl Math. 2009;28:327–364.
   Web of Science ®Google Scholar
• Gomes-Ruggiero MA, Martínez JM, Santos SA. Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints. J Sci Comput. 2009;31(3):1628–1652.
   Web of Science ®Google Scholar
• Guerrero J, Raydan M, Rojas M. A hybrid-optimization method for large-scale non-negative full regularization in image restoration. Inver Probl Sci En. 2011;21:741–766.
   Web of Science ®Google Scholar
• Liu J, Duan Y. Two spectral gradient projection methods for constrained equations and their linear convergence rate. J Inequal Appl. 2015;2015(1):8.
   Google Scholar
• Martínez JM, Pilotta EA, Raydan M. Spectral gradient methods for linearly constrained optimization. J Optim Theor Appl. 2005;125:629–651.
   Web of Science ®Google Scholar
• Wang C, Liu Q, Yang X. Convergence properties of nonmonotone spectral projected gradient methods. J Comput Appl Math. 2005;182:51–66.
   Web of Science ®Google Scholar
• Yu Z, Lin J, Sun J, et al. Spectral gradient projection method for monotone nonlinear equations with convex constraints. Appl Numer Math. 2009;59(10):2416–2423.
   Web of Science ®Google Scholar
• Zhang L, Zhou W. Spectral gradient projection method for solving nonlinear monotone equations. J Comput Appl Math. 2006;196(2):478–484.
   Web of Science ®Google Scholar
• Birgin EG, Martínez JM, Raydan M. Inexact spectral projected gradient methods on convex sets. IMA J Numer Anal. 2003;23:539–559.
   Web of Science ®Google Scholar
• Andreani R, Birgin EG, Martínez JM, et al. Spectral projected gradient and variable metric methods for optimization with linear inequalities. IMA J Numer Anal. 2005;25:221–252.
   Web of Science ®Google Scholar
• Boyle JP, Dykstra RL. A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Dykstra R, Robertson T, and Wright FT, editors. Advances in order restricted statistical inference. New York, NY: Springer; 1986. p. 28–47.
   Google Scholar
• Dunn JC. Convergence rates for conditional gradient sequences generated by implicit step length rules. SIAM J Control Optim. 1980;18(5):473–487.
   Web of Science ®Google Scholar
• Frank M, Wolfe P. An algorithm for quadratic programming. Nav Res Logist Q. 1956;3:1–295–110.
   Google Scholar
• Freund R, Grigas P. New analysis and results for the Frank-Wolfe method. Math Program. 2014. p. 1–32.
   Google Scholar
• Jaggi M. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. Proceedings of the 30th International Conference on Machine Learning (ICML-13); Vol. 28, 2013. p. 427–435.
   Google Scholar
• Gould NIM, Orban D, Toint PL. Cuter, a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw. 2003;29:373–394.
   Web of Science ®Google Scholar
• Huyer W, Neumaier A. MINQ8: general definite and bound constrained indefinite quadratic programming. Comput Optim Appl. 2018;69:351–381.
   Web of Science ®Google Scholar
• Guélat J, Marcotte P. Some comments on Wolfe's ‘away step’. Math Program. 1986;35:110–119.
   Web of Science ®Google Scholar
• Nocedal J, Wright SJ. Numerical optimization. 2nd ed. New York, NY, USA: Springer; 2006.
   Google Scholar
• Powell MJD. Log barrier methods for semi-infinite programming calculations. In: Lipitakis EA, editor. Advances on computer mathematics and its applications. 1993. p. 1–21.
   Google Scholar
• Woodgate KG. Least-squares solution of F = PG over positive semidefinite symmetric P. Linear Algebra Appl. 1996;245:171–190.
   Web of Science ®Google Scholar
• Gonçalves D, Gomes-Ruggiero M, Lavor C. A projected gradient method for optimization over density matrices. Optim Meth Softw. 2016;31(2):328–341.
   Web of Science ®Google Scholar
• Higham NJ. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 1988;103:103–118.
   Web of Science ®Google Scholar
• Gonçalves DS, Gonçalves MLN, Oliveira FR. Levenberg-Marquardt methods with inexact projections for constrained nonlinear systems. Aug 2019. arXiv:1908.06118.
   Google Scholar
• Toh K-C. An inexact primal–dual path following algorithm for convex quadratic SDP. Math Program. 2008;112(1):221–254.
   Web of Science ®Google Scholar
• Garber D. Faster projection-free convex optimization over the spectrahedron. Adv Neural Inf Processing Syst. 2016. p. 874–882.
   Google Scholar
• Allen-Zhu Z, Hazan E, Hu W, et al. Linear convergence of a Frank-Wolfe type algorithm over trace-norm balls. Adv. Neural Inf. Processing Syst. 2017. p. 6191–6200.
   Google Scholar
• Ding L, Fei Y, Xu Q, et al. Spectral Frank-Wolfe algorithm: Strict complementarity and linear convergence. Proceedings of the 37th International Conference on Machine Learning; 2020.
   Google Scholar