Image de couverture de livre

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Wenjing, Bian, Wei, Toh, Kim-Chuan
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control 90C46, 90C26, 65K05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Nonsmooth convex-concave saddle point problems with cardinality penalties
par: Bian, Wei, et autres
Publié: (2024)

On existence of solutions to non-convex minimization problems
par: Rele, Rohan, et autres
Publié: (2024)

Optimization over convex polyhedra via Hadamard parametrizations
par: Tang, Tianyun, et autres
Publié: (2024)

An efficient asymptotic DC method for sparse and low-rank matrix recovery
par: Ding, Mingcai, et autres
Publié: (2024)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
par: Dolgopolik, M. V.
Publié: (2021)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
par: Zhou, Junpeng, et autres
Publié: (2025)

Single Element Error Correction/ in a Euclidean Distance Matrix
par: Alfakih, Abdo, et autres
Publié: (2024)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
par: Meng, Kaiwen, et autres
Publié: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
par: Marumo, Naoki, et autres
Publié: (2022)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
par: Singh, Vikram, et autres
Publié: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
par: Xie, Xiyuan, et autres
Publié: (2025)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
par: Marumo, Naoki, et autres
Publié: (2023)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
par: Lin, Yizun, et autres
Publié: (2024)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
par: Kannan, Rohit, et autres
Publié: (2022)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
par: Xie, Lijun, et autres
Publié: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
par: Xie, Xiyuan, et autres
Publié: (2026)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
par: Gfrerer, H.
Publié: (2024)

Time-integrated Optimal Transport: A Robust Minimax Framework
par: Nguyen, Thai P. D., et autres
Publié: (2025)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
par: Song, Mengmeng, et autres
Publié: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
par: Brosch, Daniel, et autres
Publié: (2025)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
par: Tawarmalani, Mohit
Publié: (2024)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
par: Fest, Jean-Baptiste, et autres
Publié: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

Local Convergence of Adaptively Regularized Tensor Methods
par: Welzel, Karl, et autres
Publié: (2025)

A Bregman ADMM for Bethe variational problem
par: Khoo, Yuehaw, et autres
Publié: (2025)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
par: Chen, Xiaojun, et autres
Publié: (2022)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
par: Zhang, Na, et autres
Publié: (2025)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
par: Millán, R. Díaz, et autres
Publié: (2026)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
par: Käming, Isabella, et autres
Publié: (2024)

Splitting the Conditional Gradient Algorithm
par: Woodstock, Zev, et autres
Publié: (2023)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
par: Turan, Evren M., et autres
Publié: (2023)