Copertina

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Yang, Lei, Hu, Jingjing, Toh, Kim-Chuan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
di: Yang, Lei, et al.
Pubblicazione: (2021)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
di: Zhu, Jiayi, et al.
Pubblicazione: (2024)

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming
di: Yang, Lei, et al.
Pubblicazione: (2025)

A New Inexact Manifold Proximal Linear Algorithm with Adaptive Stopping Criteria
di: Zheng, Zhong, et al.
Pubblicazione: (2025)

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
di: Ding, Kuangyu, et al.
Pubblicazione: (2023)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
di: Ding, Kuangyu, et al.
Pubblicazione: (2024)

Inertial Proximal Difference-of-Convex Algorithm with Convergent Bregman Plug-and-Play for Nonconvex Imaging
di: Chow, Tsz Ching, et al.
Pubblicazione: (2024)

Improved Rates for Stochastic Variance-Reduced Difference-of-Convex Algorithms
di: Nguyen, Anh Duc, et al.
Pubblicazione: (2025)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
di: Jiang, Bo, et al.
Pubblicazione: (2025)

A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval
di: Zheng, Zhong, et al.
Pubblicazione: (2023)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
di: Yang, Lei, et al.
Pubblicazione: (2023)

An Inexact Variable Metric Proximal Gradient-subgradient Algorithm for a Class of Fractional Optimization Problems
di: Yang, Lei, et al.
Pubblicazione: (2025)

D-ripALM: A Tuning-friendly Decentralized Relative-Type Inexact Proximal Augmented Lagrangian Method
di: Zhu, Jiayi, et al.
Pubblicazione: (2026)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
di: Bastianello, Nicola, et al.
Pubblicazione: (2020)

Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
di: Chen, He, et al.
Pubblicazione: (2024)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
di: Huang, Ziyu, et al.
Pubblicazione: (2024)

Inexact Bregman Sparse Newton Method for Efficient Optimal Transport
di: Pan, Jianting, et al.
Pubblicazione: (2026)

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
di: Bello-Cruz, Yunier, et al.
Pubblicazione: (2024)

Inexact Accelerated Proximal Gradient Method Revisit: An Economical Variant via Shadow Points
di: Yang, Lei, et al.
Pubblicazione: (2025)

A Bregman ADMM for Bethe variational problem
di: Khoo, Yuehaw, et al.
Pubblicazione: (2025)

An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
di: Xiao, Nachuan, et al.
Pubblicazione: (2025)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
di: Eckstein, Jonathan, et al.
Pubblicazione: (2025)

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
di: Kabgani, Alireza, et al.
Pubblicazione: (2026)

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
di: Liu, Shanglin, et al.
Pubblicazione: (2024)

Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
di: Le, Ba Khiet, et al.
Pubblicazione: (2026)

An Inertial Bregman Proximal DC Algorithm for Generalized DC Programming with Application to Data Completion
di: Pan, Chenjian, et al.
Pubblicazione: (2024)

Inertial Bregman Proximal Gradient under Partial Smoothness
di: Godeme, Jean-Jacques
Pubblicazione: (2025)

Bregman Proximal Method for Efficient Communications under Similarity
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2023)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
di: Rotaru, Teodor, et al.
Pubblicazione: (2025)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
di: Alkousa, Mohammad S., et al.
Pubblicazione: (2026)

Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm
di: Ghaderi, Susan, et al.
Pubblicazione: (2026)

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
di: Kerger, Phillip, et al.
Pubblicazione: (2024)

On the convergence rates of moment-SOS hierarchies approximation of truncated moment sequences
di: Tran, Hoang Anh, et al.
Pubblicazione: (2025)

Learning-rate-free Momentum SGD with Reshuffling Converges in Nonsmooth Nonconvex Optimization
di: Hu, Xiaoyin, et al.
Pubblicazione: (2024)

A Minimization Approach for Minimax Optimization with Coupled Constraints
di: Hu, Xiaoyin, et al.
Pubblicazione: (2024)

Partial Envelope for Optimization Problem with Nonconvex Constraints
di: Hu, Xiaoyin, et al.
Pubblicazione: (2025)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
di: Xiao, Nachuan, et al.
Pubblicazione: (2025)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
di: Ferreira, Orizon P., et al.
Pubblicazione: (2024)

An Inexact Weighted Proximal Trust-Region Method
di: Maia, Leandro Farias, et al.
Pubblicazione: (2026)

A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms
di: He, Kerry, et al.
Pubblicazione: (2023)