:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	He, Jiahuan, Kan, Chao, Song, Wen
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control 90C25, 90C46, 90C05, 65K05
Accesso online:	https://arxiv.org/abs/2312.11168
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
di: Traoré, Cheik, et al.
Pubblicazione: (2025)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
di: Zhou, Yingxin, et al.
Pubblicazione: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
di: Li, Wenjing, et al.
Pubblicazione: (2023)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

Splitting Algorithms for Distributionally Robust Optimization
di: Briceño-Arias, Luis, et al.
Pubblicazione: (2024)

Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
di: Shabani, Shima, et al.
Pubblicazione: (2025)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
di: Song, Yongcun, et al.
Pubblicazione: (2024)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
di: Chen, Jian, et al.
Pubblicazione: (2026)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
di: Meng, Kaiwen, et al.
Pubblicazione: (2024)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
di: Wang, Haoning, et al.
Pubblicazione: (2025)

Performance Estimation for Smooth and Strongly Convex Sets
di: Luner, Alan, et al.
Pubblicazione: (2024)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
di: Kamijima, Tomoya, et al.
Pubblicazione: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
di: Zhang, Lu, et al.
Pubblicazione: (2026)

On Averaging and Extrapolation for Gradient Descent
di: Luner, Alan, et al.
Pubblicazione: (2024)

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

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
di: Gu, Ran, et al.
Pubblicazione: (2021)

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

Monomial barrier functions for the box-constrained convex optimization problems
di: Fayed, Hatem
Pubblicazione: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
di: Niu, Yi-Shuai, et al.
Pubblicazione: (2018)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
di: Shtern, Shimrit, et al.
Pubblicazione: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
di: Takahashi, Shota, et al.
Pubblicazione: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
di: Bao, Chenglong, et al.
Pubblicazione: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
di: Bao, Chenglong, et al.
Pubblicazione: (2023)

Nonsmooth Projection-Free Optimization with Functional Constraints
di: Asgari, Kamiar, et al.
Pubblicazione: (2023)

Nonsmooth convex-concave saddle point problems with cardinality penalties
di: Bian, Wei, et al.
Pubblicazione: (2024)

Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
di: Boţ, Radu Ioan, et al.
Pubblicazione: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
di: Nguyen, Vinh
Pubblicazione: (2025)

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

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
di: Ghosh, Suprova, et al.
Pubblicazione: (2025)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
di: Hu, Wei, et al.
Pubblicazione: (2026)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
di: Brosch, Daniel, et al.
Pubblicazione: (2025)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
di: Ran, Yifan
Pubblicazione: (2023)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
di: Nandhan, Navil, et al.
Pubblicazione: (2026)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
di: Käming, Isabella, et al.
Pubblicazione: (2024)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
di: Latafat, Puya, et al.
Pubblicazione: (2023)

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

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