MP 2011 - PDF Preprint Papers

MP 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MP-2011 Paper

click to vote

MP
2011

67views Intelligent Agents» more MP 2011»

Fixed point and Bregman iterative methods for matrix rank minimization

8 months 9 days ago

Download people.ee.duke.edu

Shiqian Ma, Donald Goldfarb, Lifeng Chen

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	67	Fixed point and Bregman iterative methods for matrix rank minimization	claim
2	64	Lifting for conic mixed-integer programming	claim
3	64	Statistical ranking and combinatorial Hodge theory	claim
4	61	Necessary global optimality conditions for nonlinear programming problems with polynomial constraints	claim
5	56	Smoothed analysis of condition numbers and complexity implications for linear programming	claim
6	55	An interior-point piecewise linear penalty method for nonlinear programming	claim
7	51	On the relative strength of split, triangle and quadrilateral cuts	claim
8	51	A warm-start approach for large-scale stochastic linear programs	claim
9	48	Null space conditions and thresholds for rank minimization	claim
10	47	Implicit solution function of P0 and Z matrix linear complementarity constraints	claim
11	47	A first-order interior-point method for linearly constrained smooth optimization	claim
12	45	On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers	claim
13	44	An FPTAS for minimizing the product of two non-negative linear cost functions	claim
14	43	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results	claim
15	42	Strong KKT conditions and weak sharp solutions in convex-composite optimization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers