Cover Image

A full splitting algorithm for structured difference-of-convex programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bot, Radu Ioan, Nenov, Rossen, Tao, Min
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C26, 65K05, 49M29
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A full splitting algorithm for fractional programs with structured numerators and denominators
by: Boţ, Radu Ioan, et al.
Published: (2023)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

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

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

Global Descent Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, 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 subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
by: Pham, Tan Nhat, et al.
Published: (2022)

Decomposition-Invariant Pairwise Frank-Wolfe Algorithm for Constrained Multiobjective Optimization
by: Fan, Zhuoxin, et al.
Published: (2024)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
by: Alcantara, Jan Harold, et al.
Published: (2025)

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

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems
by: Shaw, Barsha, et al.
Published: (2025)

A Tunneling Method for Nonlinear Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2024)

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

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)

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)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

Fast convex optimization via closed-loop time scaling of gradient dynamics
by: Attouch, Hedy, et al.
Published: (2023)

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
by: Takahashi, Shota, et al.
Published: (2023)

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

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

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

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

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

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)

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

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

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

Improved convergence rates for the multiobjective Frank-Wolfe method
by: Gonçalves, Douglas S., et al.
Published: (2024)

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

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, et al.
Published: (2025)

The Riemannian Landing Method: From projected gradient flows to SQP
by: Goyens, Florentin, et al.
Published: (2026)

A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
by: Karmarkar, Tanmaya, et al.
Published: (2025)

Accelerated primal dual fixed point algorithm
by: Zhu, Ya-Nan
Published: (2025)

Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay
by: Boţ, Radu Ioan, et al.
Published: (2024)

On existence of solutions to non-convex minimization problems
by: Rele, Rohan, et al.
Published: (2024)

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