A Newton-bracketing method for a simple conic optimization problem
暂无分享,去创建一个
[1] J. Gallier. Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.
[2] Kim-Chuan Toh,et al. B-475 Lagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems , 2014 .
[3] Marc Teboulle,et al. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..
[4] Kim-Chuan Toh,et al. Algorithm 996 , 2018, ACM Trans. Math. Softw..
[5] J. Lasserre,et al. Handbook on Semidefinite, Conic and Polynomial Optimization , 2012 .
[6] Kim-Chuan Toh,et al. SDPNAL$$+$$+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints , 2014, Math. Program. Comput..
[7] M. Kojima,et al. SIMPLIFIED COPOSITIVE AND LAGRANGIAN RELAXATIONS FOR LINEARLY CONSTRAINED QUADRATIC OPTIMIZATION PROBLEMS IN CONTINUOUS AND BINARY VARIABLES , 2017 .
[8] Kim-Chuan Toh,et al. Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints , 2020 .
[9] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..
[10] Henry Wolkowicz,et al. Handbook of Semidefinite Programming , 2000 .
[11] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..
[12] Kim-Chuan Toh,et al. LAGRANGIAN-CONIC RELAXATIONS, PART II: APPLICATIONS TO POLYNOMIAL OPTIMIZATION PROBLEMS , 2020 .
[13] Samuel Burer,et al. On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..
[14] Kim-Chuan Toh,et al. A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems , 2016, Math. Program..
[15] Masakazu Kojima,et al. Binary quadratic optimization problems that are difficult to solve by conic relaxations , 2017, Discret. Optim..
[16] Akiko Takeda,et al. BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints , 2018 .
[17] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[18] Kim-Chuan Toh,et al. Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems , 2018, J. Glob. Optim..
[19] Kim-Chuan Toh,et al. A robust Lagrangian-DNN method for a class of quadratic optimization problems , 2017, Comput. Optim. Appl..
[20] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.