:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yang, Xiangyu, Wang, Hao, Zhu, Yichen, Wang, Xiao
Format:	Preprint
Publié:	2021
Sujets:	Optimization and Control 90C26 49J52 68Q25 65K05
Accès en ligne:	https://arxiv.org/abs/2104.04400
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
par: Yuan, Ya-xiang, et autres
Publié: (2024)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
par: Gao, Yan, et autres
Publié: (2026)

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

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
par: Alves, M. Marques, et autres
Publié: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
par: Zhang, Chenyu, et autres
Publié: (2023)

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

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
par: Curtis, Frank E., et autres
Publié: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
par: Bot, Radu Ioan, et autres
Publié: (2024)

An adaptive framework for first-order gradient methods
par: Hu, Xiaozhe, et autres
Publié: (2026)

prunAdag: an adaptive pruning-aware gradient method
par: Porcelli, Margherita, et autres
Publié: (2025)

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

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
par: Burns, Matthew X., et autres
Publié: (2025)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
par: Geremew, W., et autres
Publié: (2026)

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)

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

Adaptive first-order methods with enhanced worst-case rates
par: Florea, Mihai I.
Publié: (2024)

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

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
par: Zhang, Chenyu, et autres
Publié: (2023)

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

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

A Proximal-Gradient Method for Constrained Optimization
par: Dai, Yutong, et autres
Publié: (2024)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
par: Gratton, Serge, et autres
Publié: (2025)

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

Visibility in Polygonal Environments with Holes: Finding Best Spots for Hiding and Surveillance
par: Banzal, Neilabh, et autres
Publié: (2026)

Curvature-Aware Derivative-Free Optimization
par: Kim, Bumsu, et autres
Publié: (2021)

Fast and Provable Nonconvex Robust Matrix Completion
par: Fu, Yichen, et autres
Publié: (2026)

The Intrinsic Riemannian Proximal Gradient Method for Nonconvex Optimization
par: Bergmann, Ronny, et autres
Publié: (2025)

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

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

Inexact Limited Memory Bundle Method
par: Lampainen, Jenni, et autres
Publié: (2026)

On Characterizations of $σ$-Quasiconvexity
par: Bao, Nguyen Xuan Duy, et autres
Publié: (2025)

Optimization in Theory and Practice
par: Wright, Stephen J.
Publié: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
par: Ang, Andersen, et autres
Publié: (2023)

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

Stability of Nonhomogeneous Split Equality and Split Feasibility Problems with Possibly Nonconvex Constraint Sets
par: Huong, Vu Thi, et autres
Publié: (2024)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
par: Chen, Liang, et autres
Publié: (2025)

General Constrained Matrix Optimization
par: Garner, Casey, et autres
Publié: (2024)

Spectrally Constrained Optimization
par: Garner, Casey, et autres
Publié: (2023)