ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1511.08062
  4. Cited By
Relaxed Majorization-Minimization for Non-smooth and Non-convex
  Optimization

Relaxed Majorization-Minimization for Non-smooth and Non-convex Optimization

25 November 2015
Chen Xu
Zhouchen Lin
Zhenyu Zhao
H. Zha
ArXiv (abs)PDFHTML

Papers citing "Relaxed Majorization-Minimization for Non-smooth and Non-convex Optimization"

3 / 3 papers shown
Title
Linearized Alternating Direction Method with Parallel Splitting and
  Adaptive Penalty for Separable Convex Programs in Machine Learning
Linearized Alternating Direction Method with Parallel Splitting and Adaptive Penalty for Separable Convex Programs in Machine Learning
Zhouchen Lin
Risheng Liu
Zhixun Su
72
195
0
18 Oct 2013
Online Learning for Matrix Factorization and Sparse Coding
Online Learning for Matrix Factorization and Sparse Coding
Julien Mairal
Francis R. Bach
Jean Ponce
Guillermo Sapiro
157
2,615
0
01 Aug 2009
Enhancing Sparsity by Reweighted L1 Minimization
Enhancing Sparsity by Reweighted L1 Minimization
Emmanuel J. Candes
M. Wakin
Stephen P. Boyd
217
5,045
0
10 Nov 2007
1