A penalty method for rank minimization problems in symmetric matrices (Q1616933): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963497215 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.03218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distance matrices, semidefinite programming and sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conic QPCCs, conic QCQPs and completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Low-Rank Matrix Completion by Riemannian Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensor network localization, Euclidean distance matrix completions, and graph realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated gradient methods for nonconvex nonlinear and stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calmness and exact penalization in vector optimization with cone constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: PENNON: A code for convex nonlinear and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Matrices and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementable proximal point algorithmic framework for nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation between the constant rank and the relaxed constant rank constraint qualifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point and Bregman iterative methods for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Robust) edge-based semidefinite programming relaxation of sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semidefinite programming for sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank matrix completion by alternating steepest descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3161693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Matrix Completion by Riemannian Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calmness and exact penalization in vector optimization under nonlinear perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints / rank
 
Normal rank

Revision as of 06:31, 17 July 2024

scientific article
Language Label Description Also known as
English
A penalty method for rank minimization problems in symmetric matrices
scientific article

    Statements

    A penalty method for rank minimization problems in symmetric matrices (English)
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    rank minimization
    0 references
    penalty methods
    0 references
    alternating minimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers