| Special Issue on Conic Optimization |
| Words from the guest editors: Z.-Q. Luo, L. Tunçel and N. Xiu |
Yanqin Bai, Chuanhao Guo and Liming Sun
A new algorithm for solving nonconvex quadratic programming over an ice cream cone |
Laurent El Ghaoui, Vivian Viallon and Tarek Rabbani
Safe feature elimination in sparse supervised learning |
Mirai Tanaka, Kazuhide Nakata and Hayato Waki
Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems
|
Xin-Yuan Zhao and Kim-Chuan Toh
Infeasible potential reduction algorithms for semidefinite programming
|
Xin-He Miao and Ying Zhang
Error bounds for inequality systems under the order induced by a symmetric cone |
Qingna Li
Alternating direction method for a class of constrained matrix approximation problems |
Kartik Krishnan Sivaramakrishnan and John E. Mitchell
Properties of a cutting plane method for semidefinite programming |
| Regular Papers |
João Xavier da Cruz Neto, Paulo Santos and Sissy Souza
A sufficient descent direction method for quasiconvex optimization over Riemannian manifolds |
Bingsheng He and Xiaoming Yuan
A unified framework of some proximal-based decomposition methods for monotone variational inequalities with separable structures |
|
|
|