Imagen de Portada

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Ning, Grimmer, Benjamin
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control Machine Learning 90C25, 90C52
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
por: Lin, Zhenwei, et al.
Publicado: (2022)

Optimal Methods for Unknown Piecewise Smooth Problems I: Convex Optimization
por: Lin, Zhenwei, et al.
Publicado: (2026)

Fast convergence of Frank-Wolfe algorithms on polytopes
por: Wirth, Elias, et al.
Publicado: (2024)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
por: Murota, Kazuo, et al.
Publicado: (2025)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
por: Tauheed, et al.
Publicado: (2026)

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
por: Kitaoka, Akira
Publicado: (2024)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
por: van Treek, Kira, et al.
Publicado: (2025)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
por: Geremew, W., et al.
Publicado: (2026)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
por: Ma, Chiyu, et al.
Publicado: (2026)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
por: Jiang, Ruichen, et al.
Publicado: (2022)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
por: Prakhya, Karthik, et al.
Publicado: (2026)

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

Saddle Networks: Structure-Preserving Architectures for Convex-Concave Functions
por: Warin, Xavier
Publicado: (2026)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
por: Dörfler, Daniel, et al.
Publicado: (2020)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
por: Tran-Dinh, Quoc, et al.
Publicado: (2025)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
por: García-Castaño, Fernando, et al.
Publicado: (2024)

On generators of $k$-PSD closures of the positive semidefinite cone
por: Bhardwaj, Avinash, et al.
Publicado: (2024)

Aggregating regular norms
por: Juditsky, Anatoli, et al.
Publicado: (2022)

Linear Threshold for Oertel's Conjecture on the Mixed-Integer Volume
por: Cheng, Hongyu, et al.
Publicado: (2026)

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
por: Liang, Ling, et al.
Publicado: (2024)

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
por: Nozawa, Ryota, et al.
Publicado: (2024)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2025)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
por: Behmandpoor, Pourya, et al.
Publicado: (2022)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
por: Wang, Alex L.
Publicado: (2025)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2023)

DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime
por: Park, Jongho, et al.
Publicado: (2023)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
por: García-Castaño, Fernando, et al.
Publicado: (2024)

A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
por: Nguyen-Trung, Nghia, et al.
Publicado: (2025)

Dimension-Free Descriptions of Convex Sets
por: Levin, Eitan, et al.
Publicado: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
por: Chen, Kaihuang, et al.
Publicado: (2025)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
por: Themelis, Andreas, et al.
Publicado: (2020)

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
por: Roth, Jake, et al.
Publicado: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
por: Arima, Naohiko, et al.
Publicado: (2023)

Everything is possible: constructing spectrahedra with prescribed facial dimensions
por: Roshchina, Vera, et al.
Publicado: (2023)

Isolated Calmness in Regularized Convex Optimization
por: Nghia, Tran T. A., et al.
Publicado: (2026)

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
por: Alshahrani, Mohammed
Publicado: (2026)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
por: Mashkoorzadeh, Feryal, et al.
Publicado: (2026)

Analysis of Kernel Mirror Prox for Measure Optimization
por: Dvurechensky, Pavel, et al.
Publicado: (2024)

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