Copertina

Proximal Algorithms for a class of abstract convex functions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bednarczuk, Ewa, Lorenz, Dirk, Tran, The Hung
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 49J45, 65K05, 74P10, 90C26,
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Variational analysis of unbounded and discontinuous generalized eigenvalue functions with application to topology optimization
di: Nishioka, Akatsuki, et al.
Pubblicazione: (2024)

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)

Forward-Backward algorithms for weakly convex problems
di: Bednarczuk, Ewa, et al.
Pubblicazione: (2023)

An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
di: Blank, Luise, et al.
Pubblicazione: (2015)

Multi-material structural optimization for additive manufacturing based on a phase field approach
di: Blank, Luise, et al.
Pubblicazione: (2025)

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

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

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

Calibration for minimal surfaces with free boundary and Cheeger-type problems
di: Bouchitté, Guy, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

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

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)

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

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

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)

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

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
di: Li, Hanyang, et al.
Pubblicazione: (2025)

Moreau envelope and proximal-point methods under the lens of high-order regularization
di: Kabgani, Alireza, et al.
Pubblicazione: (2025)

An inexact proximal MM method for a class of nonconvex composite image reconstruction models
di: Li, Bujin, et al.
Pubblicazione: (2024)

Stochastic homogenisation of nonlinear minimum-cost flow problems
di: Gladbach, Peter, et al.
Pubblicazione: (2024)

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

A preconditioned difference of convex functions algorithm with extrapolation and line search
di: Zhang, Ran, et al.
Pubblicazione: (2025)

Kantorovich-Rubinstein duality theory for the Hessian
di: Bołbotowski, Karol, et al.
Pubblicazione: (2024)

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

Limit of nonlinear Signorini problems for incompressible materials
di: Mainini, Edoardo, et al.
Pubblicazione: (2024)

Global Descent Method for Non-convex Multi-objective Optimization Problems
di: Adhikary, Bikram, et al.
Pubblicazione: (2025)

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

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