Image de couverture de livre

A proximal splitting algorithm for generalized DC programming with applications in signal recovery

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pham, Tan Nhat, Dao, Minh N., Amjady, Nima, Shah, Rakibuzzaman
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 90C26, 49M27, 65K05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
par: Pham, Tan Nhat, et autres
Publié: (2022)

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
par: Pham, Tan Nhat, et autres
Publié: (2024)

A full splitting algorithm for fractional programs with structured numerators and denominators
par: Boţ, Radu Ioan, et autres
Publié: (2023)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
par: Atenas, Felipe, et autres
Publié: (2024)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
par: Alcantara, Jan Harold, et autres
Publié: (2025)

A full splitting algorithm for structured difference-of-convex programs
par: Bot, Radu Ioan, et autres
Publié: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
par: Braun, Gábor, et autres
Publié: (2024)

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
par: Qian, Yitian, et autres
Publié: (2025)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
par: Qian, Yitian, et autres
Publié: (2024)

A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^p$-regularization, $p\in (0,1)$
par: Antil, Harbir, et autres
Publié: (2025)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
par: Han, Deren, et autres
Publié: (2025)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
par: Kabgani, Alireza, et autres
Publié: (2025)

Algorithmic approaches to avoiding bad local minima in nonconvex inconsistent feasibility
par: Dinh, Thi Lan, et autres
Publié: (2025)

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

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

Moreau envelope and proximal-point methods under the lens of high-order regularization
par: Kabgani, Alireza, et autres
Publié: (2025)

Optimization landscape of $\ell_0$-Bregman relaxations
par: Chirinos-Rodríguez, Jonathan, et autres
Publié: (2025)

A truncated epsilon-subdifferential method for global DC optimization
par: Bagirov, Adil M., et autres
Publié: (2025)

Fejér* monotonicity in optimization algorithms
par: Behling, Roger, et autres
Publié: (2024)

A double iteratively reweighted algorithm for solving group sparse nonconvex optimization models
par: Nie, Wanqin, et autres
Publié: (2025)

Optimality conditions via exact penalty functions
par: Ivanov, Vsevolod Ivanov
Publié: (2026)

A preconditioned difference of convex functions algorithm with extrapolation and line search
par: Zhang, Ran, et autres
Publié: (2025)

An inertial proximal splitting algorithm for hierarchical bilevel equilibria in Hilbert spaces
par: Balhag, Aicha, et autres
Publié: (2025)

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence
par: Jung, Kiyuob, et autres
Publié: (2024)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
par: Ferreira, Orizon P., et autres
Publié: (2024)

Convergence analysis of a proximal-type algorithm for DC programs with applications to variable selection
par: Wu, Shuang, et autres
Publié: (2015)

An inexact proximal MM method for a class of nonconvex composite image reconstruction models
par: Li, Bujin, et autres
Publié: (2024)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
par: Ahookhosh, Masoud, et autres
Publié: (2026)

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
par: Takahashi, Shota, et autres
Publié: (2023)

Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
par: Zhang, Penghe, et autres
Publié: (2025)

An Inexact Proximal Newton Method for Nonconvex Composite Minimization
par: Zhu, Hong
Publié: (2024)

A Stochastic Block-coordinate Proximal Newton Method for Nonconvex Composite Minimization
par: Zhu, Hong, et autres
Publié: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

Cyclic Relaxed Douglas-Rachford Splitting for Inconsistent Nonconvex Feasibility
par: Dinh, Thi Lan, et autres
Publié: (2025)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
par: Jung, Woosuk L., et autres
Publié: (2023)

Calibration for minimal surfaces with free boundary and Cheeger-type problems
par: Bouchitté, Guy, et autres
Publié: (2025)

Nonlinear Separation Theorems for Co-Radiant Sets and Optimality Conditions for Approximate and Proper Approximate Solutions in Vector Optimization
par: García-Castaño, Fernando, et autres
Publié: (2025)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
par: Salzo, Saverio
Publié: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
par: Li, Hanyang, et autres
Publié: (2025)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
par: Goldfarb, Donald, et autres
Publié: (2025)