Imagen de Portada

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Po-Wei, Chang, Wei-Cheng, Kolter, J. Zico
Formato:	Preprint
Publicado:	2017
Materias:	Optimization and Control Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Iterative regularization in classification via hinge loss diagonal descent
por: Apidopoulos, Vassilis, et al.
Publicado: (2022)

Riemannian coordinate descent algorithms on matrix manifolds
por: Han, Andi, et al.
Publicado: (2024)

Understanding Optimization in Deep Learning with Central Flows
por: Cohen, Jeremy M., et al.
Publicado: (2024)

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
por: Endor, Faniriana Rakoto, et al.
Publicado: (2024)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
por: Lauga, Guillaume
Publicado: (2026)

Scalable iterative pruning of large language and vision models using block coordinate descent
por: Rosenberg, Gili, et al.
Publicado: (2024)

A new perspective on low-rank optimization
por: Bertsimas, Dimitris, et al.
Publicado: (2021)

The power of small initialization in noisy low-tubal-rank tensor recovery
por: Liu, ZHiyu, et al.
Publicado: (2026)

Superlinear and quadratic convergence of a stabilized sequential quadratic semidefinite programming method for nonlinear semidefinite programming problems
por: Yamakawa, Yuya
Publicado: (2022)

Manifold constrained steepest descent
por: Yang, Kaiwei, et al.
Publicado: (2026)

Sampling from Boltzmann densities with physics informed low-rank formats
por: Hagemann, Paul, et al.
Publicado: (2024)

Concentration inequalities for semidefinite least squares based on data
por: Fabiani, Filippo, et al.
Publicado: (2025)

Learning mirror maps in policy mirror descent
por: Alfano, Carlo, et al.
Publicado: (2024)

Provably data-driven projection method for quadratic programming
por: Nguyen, Anh Tuan, et al.
Publicado: (2025)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
por: Wei, Jiazhen, et al.
Publicado: (2025)

An efficient primal dual semismooth Newton method for semidefinite programming
por: Deng, Zhanwang, et al.
Publicado: (2025)

Gradient descent in matrix factorization: Understanding large initialization
por: Chen, Hengchao, et al.
Publicado: (2023)

New logarithmic step size for stochastic gradient descent
por: Shamaee, M. Soheil, et al.
Publicado: (2024)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
por: Lee, Ching-pei, et al.
Publicado: (2022)

Random coordinate descent methods for nonseparable composite optimization
por: Chorobura, Flavia, et al.
Publicado: (2022)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
por: Bertoncini, Jeremy, et al.
Publicado: (2025)

The duality structure gradient descent algorithm: analysis and applications to neural networks
por: Flynn, Thomas
Publicado: (2017)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
por: Ding, Kuangyu, et al.
Publicado: (2025)

On the global convergence of gradient descent for wide shallow models with bounded nonlinearities
por: Petit, Romain, et al.
Publicado: (2026)

On semidefinite descriptions for convex hulls of quadratic programs
por: Wang, Alex L., et al.
Publicado: (2024)

Gauss-Southwell type descent methods for low-rank matrix optimization
por: Olikier, Guillaume, et al.
Publicado: (2023)

On the stability of gradient descent with second order dynamics for time-varying cost functions
por: Gibson, Travis E., et al.
Publicado: (2024)

Convergence of continuous-time stochastic gradient descent with applications to deep neural networks
por: Lugosi, Gabor, et al.
Publicado: (2024)

Towards An Unsupervised Learning Scheme for Efficiently Solving Parameterized Mixed-Integer Programs
por: Qu, Shiyuan, et al.
Publicado: (2024)

Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression
por: Lok, Jackie, et al.
Publicado: (2024)

A space-decoupling framework for optimization on bounded-rank matrices with orthogonally invariant constraints
por: Yang, Yan, et al.
Publicado: (2025)

PolyFormer: learning efficient reformulations for scalable optimization under complex physical constraints
por: Wen, Yilin, et al.
Publicado: (2026)

Linear convergence of proximal descent schemes on the Wasserstein space
por: Lascu, Razvan-Andrei, et al.
Publicado: (2024)

Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks
por: An, Jing, et al.
Publicado: (2023)

Accelerated first-order methods for a class of semidefinite programs
por: Wang, Alex L., et al.
Publicado: (2022)

Convergence of flow-based generative models via proximal gradient descent in Wasserstein space
por: Cheng, Xiuyuan, et al.
Publicado: (2023)

A stochastic gradient descent algorithm with random search directions
por: Gbaguidi, Eméric
Publicado: (2025)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
por: Zhang, Huiling, et al.
Publicado: (2023)

Learning rate adaptive stochastic gradient descent optimization methods: numerical simulations for deep learning methods for partial differential equations and convergence analyses
por: Dereich, Steffen, et al.
Publicado: (2024)

A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
por: Lee, Wei-Cheng, et al.
Publicado: (2025)