Cover Image

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Takahashi, Shota, Takeda, Akiko
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 90C26, 49M37, 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
by: Marumo, Naoki, et al.
Published: (2026)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
by: Zhang, Minxin, et al.
Published: (2024)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
by: Bai, Xiaoning, et al.
Published: (2024)

An Inexact Proximal Newton Method for Nonconvex Composite Minimization
by: Zhu, Hong
Published: (2024)

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
by: Pham, Tan Nhat, et al.
Published: (2024)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

A Stochastic Block-coordinate Proximal Newton Method for Nonconvex Composite Minimization
by: Zhu, Hong, et al.
Published: (2024)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)

Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy
by: He, Yitong, et al.
Published: (2025)

A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^p$-regularization, $p\in (0,1)$
by: Antil, Harbir, et al.
Published: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
by: Braun, Gábor, et al.
Published: (2024)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

A cut-and-project perspective for linearized Bregman iterations
by: Dai, Yu-Hong, et al.
Published: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
by: Han, Deren, et al.
Published: (2025)

Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
by: Zhang, Penghe, et al.
Published: (2025)

Retractions by Alternating Projections
by: Chen, Shixiang, et al.
Published: (2026)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
by: Scheinberg, Katya, et al.
Published: (2023)

Cyclic Relaxed Douglas-Rachford Splitting for Inconsistent Nonconvex Feasibility
by: Dinh, Thi Lan, et al.
Published: (2025)

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2026)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

A Second-Order Algorithm Based on Affine Scaling Interior-Point Methods for nonlinear Optimisation with bound constraints
by: Pei, Yonggang, et al.
Published: (2026)

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
by: Bento, G. C., et al.
Published: (2024)

Efficient Implementation of Third-Order Tensor Methods with Adaptive Regularization for Unconstrained Optimization
by: Cartis, Coralia, et al.
Published: (2024)

The Intrinsic Riemannian Proximal Gradient Method for Nonconvex Optimization
by: Bergmann, Ronny, et al.
Published: (2025)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
by: Goldfarb, Donald, et al.
Published: (2025)

Majorization-minimization Bregman proximal gradient algorithms for NMF with the Kullback--Leibler divergence
by: Takahashi, Shota, et al.
Published: (2024)

A Cubic Regularization Method for Multiobjective Optimization
by: Gonçalves, Douglas S., et al.
Published: (2025)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
by: Ahookhosh, Masoud, et al.
Published: (2026)

Modified parameter of Dai Liao conjugacy condition of the conjugate gradient method
by: Alhawarat, Ahmad
Published: (2023)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

A full splitting algorithm for structured difference-of-convex programs
by: Bot, Radu Ioan, et al.
Published: (2025)

A proximal splitting algorithm for generalized DC programming with applications in signal recovery
by: Pham, Tan Nhat, et al.
Published: (2024)

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
by: Qian, Yitian, et al.
Published: (2025)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
by: Qian, Yitian, et al.
Published: (2024)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
by: Pham, Tan Nhat, et al.
Published: (2022)