Copertina

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Nishioka, Akatsuki, Kanno, Yoshihiro
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control 90C25, 90C90
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
di: Nishioka, Akatsuki, et al.
Pubblicazione: (2023)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
di: Sujanani, Arnesh, et al.
Pubblicazione: (2024)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
di: Sakabe, Keiya
Pubblicazione: (2026)

On the convergence of proximal gradient methods for convex simple bilevel optimization
di: Latafat, Puya, et al.
Pubblicazione: (2023)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
di: Ang, Andersen, et al.
Pubblicazione: (2023)

A squared smoothing Newton method for semidefinite programming
di: Liang, Ling, et al.
Pubblicazione: (2023)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
di: Mazanti, Guilherme, et al.
Pubblicazione: (2024)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
di: Papp, Dávid, et al.
Pubblicazione: (2025)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
di: Yang, Yaguang
Pubblicazione: (2022)

Extragradient method with feasible inexact projection to variational inequality problem
di: Millán, R. Díaz, et al.
Pubblicazione: (2023)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
di: Latafat, Puya, et al.
Pubblicazione: (2019)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Second-order cone programming for distributionally robust compliance optimization of trusses considering input distribution uncertainty
di: Fujiyama, Takumi, et al.
Pubblicazione: (2025)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
di: Starnes, Andrew, et al.
Pubblicazione: (2023)

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

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
di: Guigues, Vincent, et al.
Pubblicazione: (2017)

A new envelope function for nonsmooth DC optimization
di: Themelis, Andreas, et al.
Pubblicazione: (2020)

A symmetric primal-dual algorithmic framework for saddle point problems
di: He, Hongjin, et al.
Pubblicazione: (2022)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
di: Zhou, Bin, et al.
Pubblicazione: (2025)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
di: Marumo, Hiroki, et al.
Pubblicazione: (2024)

A conditional gradient homotopy method with applications to Semidefinite Programming
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2022)

Augmented Lagrangian methods for fully convex composite optimization
di: De Marchi, Alberto, et al.
Pubblicazione: (2025)

Stochastic interior-point methods for smooth conic optimization with applications
di: He, Chuan, et al.
Pubblicazione: (2024)

A high-order augmented Lagrangian method with arbitrarily fast convergence
di: Lee, Young-Ju, et al.
Pubblicazione: (2026)

Using second-order information in gradient sampling methods for nonsmooth optimization
di: Gebken, Bennet
Pubblicazione: (2022)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
di: Dahl, Joachim, et al.
Pubblicazione: (2025)

Projection-based curve pattern search for black-box optimization over smooth convex sets
di: Jia, Xiaoxi, et al.
Pubblicazione: (2025)

Sharp bounds in perturbed smooth optimization
di: Spokoiny, Vladimir
Pubblicazione: (2025)

A solution method for arbitrary polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

Nonlinear conjugate gradient for smooth convex functions
di: Karimi, Sahar, et al.
Pubblicazione: (2021)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
di: Cecere, Francesco, et al.
Pubblicazione: (2025)

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)

Convex quartic problems: homogenized gradient method and preconditioning
di: Dragomir, Radu-Alexandru, et al.
Pubblicazione: (2023)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
di: Alcantara, Jan Harold, et al.
Pubblicazione: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
di: Ghaderi, Susan, et al.
Pubblicazione: (2025)

Adaptive proximal gradient methods are universal without approximation
di: Oikonomidis, Konstantinos A., et al.
Pubblicazione: (2024)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

A Riemannian Accelerated Proximal Gradient Method
di: Feng, Shuailing, et al.
Pubblicazione: (2025)