MP 2016 - PDF Preprint Papers

MP 2016

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MP-2016 Paper

click to vote

MP
2016

73views Information Technology» more MP 2016»

A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems

8 years 7 months ago

Download www.math.nus.edu.sg

We consider a class of matrix spectral norm approximation problems for ﬁnding an aﬃne combination of given matrices having the minimal spectral norm subject to some prescribed ...

Caihua Chen, Yong-Jin Liu, Defeng Sun, Kim-Chuan T...

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	73	A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems	claim
2	65	Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization	claim
3	64	A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems	claim
4	64	Spectral simplex method	claim
5	60	Constraint aggregation for rigorous global optimization	claim
6	59	Error bounds for mixed integer linear optimization problems	claim
7	58	Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization	claim
8	56	A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions	claim
9	54	The continuous knapsack set	claim
10	53	Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles	claim
11	53	The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent	claim
12	52	Accelerated gradient methods for nonconvex nonlinear and stochastic programming	claim
13	51	Parallel coordinate descent methods for big data optimization	claim
14	50	Continuous knapsack sets with divisible capacities	claim
15	48	New analysis and results for the Frank-Wolfe method	claim
16	47	Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm	claim
17	46	Distributionally robust chance constraints for non-linear uncertainties	claim
18	45	A doubly stabilized bundle method for nonsmooth convex optimization	claim
19	45	Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation	claim
20	45	A dynamic inequality generation scheme for polynomial programming	claim
21	45	A deterministic rescaled perceptron algorithm	claim
22	42	Worst case complexity of direct search under convexity	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers