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"

4 / 4 papers shown
Title
Convex Clustering through MM: An Efficient Algorithm to Perform
  Hierarchical Clustering
Convex Clustering through MM: An Efficient Algorithm to Perform Hierarchical Clustering
Daniel J. W. Touw
P. Groenen
Y. Terada
51
3
0
03 Nov 2022
Truncated Inference for Latent Variable Optimization Problems:
  Application to Robust Estimation and Learning
Truncated Inference for Latent Variable Optimization Problems: Application to Robust Estimation and Learning
Christopher Zach
Huu Le
50
4
0
12 Mar 2020
Proximal Alternating Direction Network: A Globally Converged Deep
  Unrolling Framework
Proximal Alternating Direction Network: A Globally Converged Deep Unrolling Framework
Risheng Liu
Xin-Yue Fan
Shichao Cheng
Xiangyu Wang
Zhongxuan Luo
85
26
0
21 Nov 2017
A Unified Convex Surrogate for the Schatten-$p$ Norm
A Unified Convex Surrogate for the Schatten-ppp Norm
Chen Xu
Zhouchen Lin
H. Zha
48
52
0
25 Nov 2016
1