An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming
We present an inexact spectral bundle method for solving convex quadratic symmetric cone programming (CQSCP). This method is a first-order method, hence requires much less computational cost in each iteration than second-order approaches such as interior-point methods. In each iteration of our method...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/48908 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|