Image de couverture de livre

Linear Convergence and Error Bounds for Optimization Without Strong Convexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	van Treek, Kira, Peña, Javier F., Vera, Juan C., Zuluaga, Luis F.
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90C25, 90C20, 90C05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Duality of Hoffman constants
par: Pena, Javier F., et autres
Publié: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
par: Chen, Kaihuang, et autres
Publié: (2025)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
par: Gu, Ran, et autres
Publié: (2021)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
par: Wang, Alex L.
Publié: (2025)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
par: Arima, Naohiko, et autres
Publié: (2023)

Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
par: Shen, Ya, et autres
Publié: (2025)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
par: Wang, Haoning, et autres
Publié: (2025)

On Convergence of Regularized Barzilai-Borwein Method
par: Xu, Xin
Publié: (2025)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
par: Chen, Kaihuang, et autres
Publié: (2025)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2025)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
par: Kojima, Masakazu, et autres
Publié: (2025)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
par: Yang, Lei, et autres
Publié: (2023)

Performance Estimation for Smooth and Strongly Convex Sets
par: Luner, Alan, et autres
Publié: (2024)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
par: Dörfler, Daniel, et autres
Publié: (2020)

HPR-LP: An implementation of an HPR method for solving linear programming
par: Chen, Kaihuang, et autres
Publié: (2024)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
par: Tauheed, et autres
Publié: (2026)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
par: Lin, Zhenwei, et autres
Publié: (2022)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

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

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
par: Niu, Yi-Shuai, et autres
Publié: (2018)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
par: Bao, Chenglong, et autres
Publié: (2023)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
par: Hou, Di, et autres
Publié: (2023)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
par: Cifuentes, Diego, et autres
Publié: (2026)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
par: Xu, Xin
Publié: (2024)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
par: Yildirim, E. Alper
Publié: (2025)

Algebraic Farkas Lemma and Strong Duality for Perturbed Conic Linear Programming
par: Khanh, P. D., et autres
Publié: (2026)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
par: Xu, Xin
Publié: (2025)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
par: Arima, Naohiko, et autres
Publié: (2024)

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
par: Sharma, Sonali, et autres
Publié: (2026)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
par: Rothschild, Jacob H.
Publié: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
par: Quintero, Rodolfo A., et autres
Publié: (2024)

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
par: Liu, Ning, et autres
Publié: (2023)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
par: García-Castaño, Fernando, et autres
Publié: (2024)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
par: Bednarczuk, Ewa M., et autres
Publié: (2024)

Measure This, Not That: Optimizing the Cost and Model-Based Information Content of Measurements
par: Wang, Jialu, et autres
Publié: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
par: Sun, Defeng, et autres
Publié: (2024)