arXiv Machine Learning August 7, 2026 By Weifeng Yang

An Inertial Block Proximal Linearized Method with Adaptive Momentum for Nonconvex and Nonsmooth Optimization

Read the original on arXiv Machine Learning →

arXiv:2608. 05502v1 Announce Type: cross Abstract: In this paper, we consider a class of multiblock nonconvex nonsmooth optimization problems, which covers many applications such as the analysis of pre-earthquake anomalies and machine learning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

benchmarks

arXiv Machine Learning

2d ago

Generalized Geometry Block Proximal Linearized Method for Multiblock Nonconvex and Nonsmooth Optimization

arXiv:2609.39301v1 Announce Type: cross Abstract: This paper considers a class of multiblock nonconvex and nonsmooth optimization problems arising in many applications. Existing methods construct pro...

By Weifeng Yang

benchmarks

arXiv Machine Learning

Aug 14

A Local-Linearly Convergent Algorithm for Nonconvex Equality-Constrained Optimization

arXiv:2608. 12665v1 Announce Type: cross Abstract: For solving nonconvex equality-constrained optimization problems, a recent Gradient-Eigenstep Algorithm by Goyens et al.

By Frank E. Curtis, Lingjun Guo, Daniel P. Robinson

arXiv Statistics ML

Sep 16

A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints

arXiv:2509.02894v2 Announce Type: replace-cross Abstract: We propose an inexact proximal augmented Lagrangian method (P-ALM) for nonconvex structured optimization problems. The proposed method featur...

By Adeyemi D. Adeoye, Puya Latafat, Alberto Bemporad

arXiv Machine Learning

Jul 13

Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity

arXiv:2607. 08954v1 Announce Type: cross Abstract: We study nonasymptotic convergence of primal-dual methods for a class of nonconvex constrained optimization problems with a convex-composite structure.

By Linglingzhi Zhu, Jiajin Li

safety

arXiv Computer Vision

Aug 26

Adaptive Extrapolated Proximal Gradient Methods with Variance Reduction for Composite Nonconvex Finite-Sum Minimization

arXiv:2502.21099v3 Announce Type: replace-cross Abstract: This paper proposes {\sf AEPG-SPIDER}, an Adaptive Extrapolated Proximal Gradient (AEPG) method with variance reduction for minimizing compos...

By Ganzhao Yuan

arXiv Machine Learning

Jun 9

OptMuon: Closed-Loop Orthogonalized Momentum Methods for Stochastic Optimization with Zero-Noise Optimality

arXiv:2606. 08783v1 Announce Type: cross Abstract: Orthogonalized momentum updates, as used in Muon-style optimizers, have recently shown strong empirical stability in large-scale deep learning.

By Ganzhao Yuan

One email a morning, machine-written

Related stories

Generalized Geometry Block Proximal Linearized Method for Multiblock Nonconvex and Nonsmooth Optimization

A Local-Linearly Convergent Algorithm for Nonconvex Equality-Constrained Optimization

A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints

Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity

Adaptive Extrapolated Proximal Gradient Methods with Variance Reduction for Composite Nonconvex Finite-Sum Minimization

OptMuon: Closed-Loop Orthogonalized Momentum Methods for Stochastic Optimization with Zero-Noise Optimality