z-logo
open-access-imgOpen Access
A Proximal Alternating Direction Method for Semi-Definite Rank Minimization
Author(s) -
Ganzhao Yuan,
Bernard Ghanem
Publication year - 2016
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v30i1.10228
Subject(s) - karush–kuhn–tucker conditions , rank (graph theory) , positive definite matrix , minification , stationary point , sequence (biology) , mathematical optimization , computer science , range (aeronautics) , convex optimization , optimization problem , regular polygon , proximal gradient methods , algorithm , mathematics , combinatorics , mathematical analysis , eigenvalues and eigenvectors , physics , materials science , geometry , quantum mechanics , biology , composite material , genetics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom