Saved in:
| Main Authors: | Wang, Chengjing, Tang, Peipei, He, Wenling, Lin, Meixia |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2308.08852 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)
by: Loris, Ignace, et al.
Published: (2023)
An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
by: Chen, Liang, et al.
Published: (2025)
by: Chen, Liang, et al.
Published: (2025)
ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)
by: Kabgani, Alireza, et al.
Published: (2025)
Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)
by: Ou, Hongjia, et al.
Published: (2025)
Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)
by: Zhou, Yingxin, et al.
Published: (2025)
The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)
by: Salzo, Saverio
Published: (2025)
Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)
by: Berahas, Albert S., et al.
Published: (2025)
On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)
by: Bollapragada, Raghu, et al.
Published: (2025)
A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)
by: Zhang, Ran, et al.
Published: (2025)
ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)
by: Kabgani, Alireza, et al.
Published: (2024)
Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)
by: Bao, Chenglong, et al.
Published: (2024)
The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)
by: Bao, Chenglong, et al.
Published: (2023)
A full splitting algorithm for fractional programs with structured numerators and denominators
by: Boţ, Radu Ioan, et al.
Published: (2023)
by: Boţ, Radu Ioan, et al.
Published: (2023)
Parallel block coordinate descent methods with identification strategies
by: Lopes, Ronaldo, et al.
Published: (2025)
by: Lopes, Ronaldo, et al.
Published: (2025)
Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
by: Tsipinakis, Nick, et al.
Published: (2025)
by: Tsipinakis, Nick, et al.
Published: (2025)
A Scale-Shape Dual Newton Method for Entropic Least Squares
by: Barnfield, Nicholas, et al.
Published: (2026)
by: Barnfield, Nicholas, et al.
Published: (2026)
A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2024)
by: Ansary, Md Abu Talhamainuddin
Published: (2024)
On Differential Stability of a Class of Convex Optimization Problems
by: Yen, Nguyen Dong, et al.
Published: (2024)
by: Yen, Nguyen Dong, et al.
Published: (2024)
Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)
by: Traoré, Cheik, et al.
Published: (2025)
On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)
by: Latafat, Puya, et al.
Published: (2023)
On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)
by: Latafat, Puya, et al.
Published: (2023)
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)
by: Latafat, Puya, et al.
Published: (2023)
Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)
by: Takahashi, Shota, et al.
Published: (2025)
A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)
by: Song, Yongcun, et al.
Published: (2024)
Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)
by: Wang, Haoning, et al.
Published: (2025)
Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)
by: Fahy, Patrick, et al.
Published: (2024)
Connections between convex optimization algorithms and subspace correction methods
by: Jiang, Boou, et al.
Published: (2025)
by: Jiang, Boou, et al.
Published: (2025)
An augmented Lagrangian method for strongly regular minimizers in a class of convex composite optimization problems
by: Wang, Chengjing, et al.
Published: (2025)
by: Wang, Chengjing, et al.
Published: (2025)
Perturbation analysis of a class of composite optimization problems
by: Tang, Peipei, et al.
Published: (2024)
by: Tang, Peipei, et al.
Published: (2024)
Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
by: Alshahrani, Mohammed
Published: (2026)
by: Alshahrani, Mohammed
Published: (2026)
Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)
by: Fayed, Hatem
Published: (2024)
Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)
by: Wright, Stephen J.
Published: (2025)
Fast projection onto the top-k-sum constraint
by: Pan, Jianting, et al.
Published: (2025)
by: Pan, Jianting, et al.
Published: (2025)
Fejér* monotonicity in optimization algorithms
by: Behling, Roger, et al.
Published: (2024)
by: Behling, Roger, et al.
Published: (2024)
Flexible block-iterative analysis for the Frank-Wolfe algorithm
by: Braun, Gábor, et al.
Published: (2024)
by: Braun, Gábor, et al.
Published: (2024)
A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)
by: Li, Hongda, et al.
Published: (2026)
MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)
by: Ang, Andersen, et al.
Published: (2023)
A simple iterative algorithm for maxcut
by: Shao, Sihong, et al.
Published: (2018)
by: Shao, Sihong, et al.
Published: (2018)
Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)
by: Jin, Ruinan, et al.
Published: (2026)
Continuous iterative algorithms for anti-Cheeger cut
by: Shao, Sihong, et al.
Published: (2021)
by: Shao, Sihong, et al.
Published: (2021)
Similar Items
-
Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023) -
An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
by: Chen, Liang, et al.
Published: (2025) -
ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025) -
Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025) -
Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)