Access the full text.
Sign up today, get DeepDyve free for 14 days.
X. Huang, K. Teo, Xiaoqi Yang (2006)
Calmness and Exact Penalization in Vector Optimization with Cone ConstraintsComputational Optimization and Applications, 35
Raghunandan Keshavan, A. Montanari, Sewoong Oh (2009)
Matrix completion from a few entries2009 IEEE International Symposium on Information Theory
Jian-Feng Cai, E. Candès, Zuowei Shen (2008)
A Singular Value Thresholding Algorithm for Matrix CompletionSIAM J. Optim., 20
J. Zhai, X. Huang (2014)
Calmness and Exact Penalization in Vector Optimization under Nonlinear PerturbationsJournal of Optimization Theory and Applications, 162
Leo Liberti, N. Maculan (2006)
Global optimization : from theory to implementation
Qingna Li, H. Qi (2011)
A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix ProblemSIAM J. Optim., 21
Y Ding (2008)
10.1007/s11081-008-9072-0Optim. Eng., 11
Shu Lu (2012)
Relation between the constant rank and the relaxed constant rank constraint qualificationsOptimization, 61
J Tanner, K Wei (2016)
Low rank matrix completion by alternating steepest descent methodsAppl. Comput. Harmonic Anal., 40
B. Recht, Maryam Fazel, P. Parrilo (2007)
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Rev., 52
A. So, Y. Ye (2005)
Theory of semidefinite programming for Sensor Network LocalizationMathematical Programming, 109
M. Anjos, J. Lasserre (2012)
Handbook on Semidefinite, Conic and Polynomial OptimizationHandbook on Semidefinite, Conic and Polynomial Optimization
Saeed Ghadimi, Guanghui Lan (2013)
Accelerated gradient methods for nonconvex nonlinear and stochastic programmingMathematical Programming, 156
RH Keshavan, A Montanari, S Oh (2010)
Matrix completion from a few entriesIEEE Trans. Inf. Theory, 56
Bart Vandereycken (2012)
Low-Rank Matrix Completion by Riemannian OptimizationSIAM J. Optim., 23
Karthika Mohan, Maryam Fazel (2012)
Iterative reweighted algorithms for matrix rank minimizationJ. Mach. Learn. Res., 13
(2015)
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp
Hongyang Zhang, Zhouchen Lin, Chao Zhang (2013)
A Counterexample for the Validity of Using Nuclear Norm as a Convex Surrogate of Rank
Qihang Lin, Zhaosong Lu, Lin Xiao (2015)
An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk MinimizationSIAM J. Optim., 25
Zhang Liu, L. Vandenberghe (2009)
Interior-Point Method for Nuclear Norm Approximation with Application to System IdentificationSIAM J. Matrix Anal. Appl., 31
Yi Zhang, Liwei Zhang, Jia Wu (2011)
Convergence Properties of a Smoothing Approach for Mathematical Programs with Second-Order Cone Complementarity ConstraintsSet-Valued and Variational Analysis, 19
N. Srebro, T. Jaakkola (2003)
Weighted Low-Rank Approximations
Jia Wu, Liwei Zhang (2015)
On Properties of the Bilinear Penalty Function Method for Mathematical Programs with Semidefinite Cone Complementarity ConstraintsSet-Valued and Variational Analysis, 23
O. Burdakov, C. Kanzow, Alexandra Schwartz (2016)
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization MethodSIAM J. Optim., 26
RH Keshavan (2010)
10.1109/TIT.2010.2046205IEEE Trans. Inf. Theory, 56
Zhouchen Lin, Minming Chen, Yi Ma (2010)
The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank MatricesJournal of structural biology, 181 2
Karthika Mohan, Maryam Fazel (2010)
Reweighted nuclear norm minimization with application to system identificationProceedings of the 2010 American Control Conference
H Zhang, Z Lin, C Zhang (2013)
A Counterexample for the Validity of Using Nuclear Norm as a Convex Surrogate of Rank, in Machine Learning and Knowledge Discovery in Databases
P. Kaestner (2016)
Linear And Nonlinear Programming
YE Nesterov (2008)
How to advance in structural convex optimizationOptima, 78
Nathan Krislock, Henry Wolkowicz (2012)
Euclidean Distance Matrices and Applications
J Tanner (2016)
10.1016/j.acha.2015.08.003Appl. Comput. Harmonic Anal., 40
Y. Nesterov (2014)
Introductory Lectures on Convex Optimization - A Basic Course, 87
J. Ye, Jinchuan Zhou (2016)
First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity ConstraintsSIAM J. Optim., 26
K. Toh, S. Yun (2009)
An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
M. Laurent (1998)
A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems
F. Clarke (1983)
Optimization And Nonsmooth Analysis
M. Feng, J. Mitchell, J. Pang, Xin Shen (2013)
Complementarity Formulations of ' 0 -norm Optimization Problems
Xiaodong Li, Shuyang Ling, T. Strohmer, Ke Wei (2016)
Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex OptimizationArXiv, abs/1606.04933
M. Hestenes, E. Stiefel (1952)
Methods of conjugate gradients for solving linear systemsJournal of research of the National Bureau of Standards, 49
Huan Li, Zhouchen Lin (2015)
Accelerated Proximal Gradient Methods for Nonconvex Programming
J. Bolte, Shoham Sabach, M. Teboulle (2014)
Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 146
Yichuan Ding, Nathan Krislock, Jiawei Qian, Henry Wolkowicz (2006)
Sensor Network Localization, Euclidean Distance Matrix completions, and graph realizationOptimization and Engineering, 11
M. Kočvara, M. Stingl (2003)
PENNON: A code for convex nonlinear and semidefinite programmingOptimization Methods and Software, 18
Mark Schmidt, Nicolas Roux, F. Bach (2011)
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
A. Alfakih, Philippe Charron, V. Piccialli, Henry Wolkowicz (2011)
Euclidean distance matrices, semidefinite programming and sensor network localizationPortugaliae Mathematica, 68
Maryam Fazel, H. Hindi, Stephen Boyd (2001)
A rank minimization heuristic with application to minimum order system approximationProceedings of the 2001 American Control Conference. (Cat. No.01CH37148), 6
(2016)
Guarantees of Reimannian optimization for low rank matrix completion
M Grant, S Boyd, Y Ye (2006)
Nonconvex Optimization and its Applications
Cho-Jui Hsieh, P. Olsen (2014)
Nuclear Norm Minimization via Active Subspace Selection
Lijie Bai, J. Mitchell, J. Pang (2016)
On conic QPCCs, conic QCQPs and completely positive programsMathematical Programming, 159
Ruoyu Sun, Z. Luo (2014)
Guaranteed Matrix Completion via Nonconvex Factorization2015 IEEE 56th Annual Symposium on Foundations of Computer Science
(1983)
Amethod for unconstrained convexminimization problemwith the rate of convergence o(1/k2)
Yong-Jin Liu, Defeng Sun, K. Toh (2012)
An implementable proximal point algorithmic framework for nuclear norm minimizationMathematical Programming, 133
Shiqian Ma, D. Goldfarb, Lifeng Chen (2009)
Fixed point and Bregman iterative methods for matrix rank minimizationMathematical Programming, 128
H. Qi, Defeng Sun (2006)
A Quadratically Convergent Newton Method for Computing the Nearest Correlation MatrixSIAM J. Matrix Anal. Appl., 28
Ting Pong, P. Tseng (2011)
(Robust) Edge-based semidefinite programming relaxation of sensor network localizationMathematical Programming, 130
Léopold Cambier, P. Absil (2016)
Robust Low-Rank Matrix Completion by Riemannian OptimizationSIAM J. Sci. Comput., 38
William Cook (2008)
Mathematical Programming Society Newsletter Structural Convex Optimization 2 MPS Chair ’ s Column 6 Smooth Semidefinite Optimization 9 Mathematical Programming Computation : A New MPS Journal
Hiroshi Yamashita, H. Yabe (2015)
A survey of numerical methods for nonlinear semidefinite programmingJournal of The Operations Research Society of Japan, 58
Chao Ding, Defeng Sun, J. Ye (2013)
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraintsMathematical Programming, 147
The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive semidefinite matrices to be complementary. This is a continuous and nonconvex reformulation of the rank minimization problem. We investigate calmness of locally optimal solutions to the SDCMPCC formulation and hence show that any locally optimal solution is a KKT point. We develop a penalty formulation of the problem. We present calmness results for locally optimal solutions to the penalty formulation. We also develop a proximal alternating linearized minimization (PALM) scheme for the penalty formulation, and investigate the incorporation of a momentum term into the algorithm. Computational results are presented.
Computational Optimization and Applications – Springer Journals
Published: May 30, 2018
Access the full text.
Sign up today, get DeepDyve free for 14 days.