Copertina

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ferreira, Orizon P., Mordukhovich, Boris S., Santos, Wilkreffy M. S., Souza, João Carlos O.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 49J53, 90C26, 65K05, 65K10
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Algorithmic approaches to avoiding bad local minima in nonconvex inconsistent feasibility
di: Dinh, Thi Lan, et al.
Pubblicazione: (2025)

Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
di: Evens, Brecht, et al.
Pubblicazione: (2023)

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

Inexact Limited Memory Bundle Method
di: Lampainen, Jenni, et al.
Pubblicazione: (2026)

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

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

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

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
di: Kabgani, Alireza, et al.
Pubblicazione: (2024)

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

Practical Regularized Quasi-Newton Methods with Inexact Function Values
di: Hamaguchi, Hiroki, et al.
Pubblicazione: (2026)

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

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

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

Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions
di: Bento, G. C., et al.
Pubblicazione: (2024)

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

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

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

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
di: Marumo, Naoki
Pubblicazione: (2025)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
di: Yuan, Ya-xiang, et al.
Pubblicazione: (2024)

Nonmonotone subgradient methods based on a local descent lemma
di: Aragón-Artacho, Francisco J., et al.
Pubblicazione: (2025)

A penalty barrier framework for nonconvex constrained optimization
di: De Marchi, Alberto, et al.
Pubblicazione: (2024)

A Projected Variable Smoothing for Weakly Convex Optimization and Supremum Functions
di: López-Rivera, Sergio, et al.
Pubblicazione: (2025)

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

Inertial Methods with Viscous and Hessian driven Damping for Non-Convex Optimization
di: Maulen-Soto, Rodrigo, et al.
Pubblicazione: (2024)

A truncated epsilon-subdifferential method for global DC optimization
di: Bagirov, Adil M., et al.
Pubblicazione: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

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

Variational analysis of determinantal varieties
di: Yang, Yan, et al.
Pubblicazione: (2025)

Proximal Algorithms for a class of abstract convex functions
di: Bednarczuk, Ewa, et al.
Pubblicazione: (2024)

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

Convergence of the Chambolle-Pock Algorithm in the Absence of Monotonicity
di: Evens, Brecht, et al.
Pubblicazione: (2023)

Stability of Nonhomogeneous Split Equality and Split Feasibility Problems with Possibly Nonconvex Constraint Sets
di: Huong, Vu Thi, et al.
Pubblicazione: (2024)

Stability analysis of split equality and split feasibility problems
di: Huong, Vu Thi, et al.
Pubblicazione: (2024)

On a robust approach to "split" feasibility problems: solvability and global error bound conditions
di: Uderzo, Amos
Pubblicazione: (2025)

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
di: Soe, Santanu, et al.
Pubblicazione: (2025)

Smoothness of Subgradient Mappings and Its Applications in Parametric Optimization
di: Hang, Nguyen T. V., et al.
Pubblicazione: (2023)

The Performance of MBFGS with Different Inexact Line Search Rule
di: Sahu, Manish Kumar, et al.
Pubblicazione: (2022)

Inexact DC Algorithms in Hilbert Spaces with Applications to PDE-Constrained Optimization
di: Khanh, P. D., et al.
Pubblicazione: (2026)

Implicit augmented Lagrangian and generalized optimization
di: De Marchi, Alberto
Pubblicazione: (2023)