Analysis of Kernel Mirror Prox for Measure Optimization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | Dvurechensky, Pavel, Zhu, Jia-Jie |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
Improved global performance guarantees of second-order methods in convex minimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)
par: Dvurechensky, Pavel, et autres
Publié: (2024)
Barrier Algorithms for Constrained Non-Convex Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)
par: Dvurechensky, Pavel, et autres
Publié: (2024)
Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)
par: Zhang, Liwei, et autres
Publié: (2025)
Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
par: Nesterov, Yurii
Publié: (2025)
par: Nesterov, Yurii
Publié: (2025)
Kurdyka-Łojasiewicz exponent via Hadamard parametrization
par: Ouyang, Wenqing, et autres
Publié: (2024)
par: Ouyang, Wenqing, et autres
Publié: (2024)
Kurdyka-Łojasiewicz exponent via square transformation
par: Ouyang, Wenqing
Publié: (2025)
par: Ouyang, Wenqing
Publié: (2025)
Accelerating preconditioned ADMM via degenerate proximal point mappings
par: Sun, Defeng, et autres
Publié: (2024)
par: Sun, Defeng, et autres
Publié: (2024)
Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
par: Suvorikova, Alexandra, et autres
Publié: (2026)
par: Suvorikova, Alexandra, et autres
Publié: (2026)
A conditional gradient homotopy method with applications to Semidefinite Programming
par: Dvurechensky, Pavel, et autres
Publié: (2022)
par: Dvurechensky, Pavel, et autres
Publié: (2022)
Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
par: Hua, Zheng, et autres
Publié: (2021)
par: Hua, Zheng, et autres
Publié: (2021)
Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
par: Kitaoka, Akira
Publié: (2024)
par: Kitaoka, Akira
Publié: (2024)
On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
par: Wu, Hanju, et autres
Publié: (2025)
par: Wu, Hanju, et autres
Publié: (2025)
Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
par: Zhang, Chenyu, et autres
Publié: (2023)
par: Zhang, Chenyu, et autres
Publié: (2023)
Policy Optimization over General State and Action Spaces
par: Ju, Caleb, et autres
Publié: (2022)
par: Ju, Caleb, et autres
Publié: (2022)
Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
par: Chu, Hong T. M.
Publié: (2026)
par: Chu, Hong T. M.
Publié: (2026)
Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
par: Lin, Zhenwei, et autres
Publié: (2022)
par: Lin, Zhenwei, et autres
Publié: (2022)
Performance Estimation of second-order optimization methods on classes of univariate functions
par: Rubbens, Anne, et autres
Publié: (2025)
par: Rubbens, Anne, et autres
Publié: (2025)
A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
par: Rubbens, Anne, et autres
Publié: (2024)
par: Rubbens, Anne, et autres
Publié: (2024)
Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
par: Bousselmi, Nizar, et autres
Publié: (2023)
par: Bousselmi, Nizar, et autres
Publié: (2023)
On the Hardness of the $L_1-L_2$ Regularization Problem
par: Ouyang, Yuyuan, et autres
Publié: (2024)
par: Ouyang, Yuyuan, et autres
Publié: (2024)
The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
par: Zhou, Bin, et autres
Publié: (2025)
par: Zhou, Bin, et autres
Publié: (2025)
Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
par: Gupta, Swati, et autres
Publié: (2026)
par: Gupta, Swati, et autres
Publié: (2026)
CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
par: Condat, Laurent, et autres
Publié: (2022)
par: Condat, Laurent, et autres
Publié: (2022)
Lipschitz-free Projected Subgradient Method with Time-varying Step-size
par: Xia, Yong, et autres
Publié: (2024)
par: Xia, Yong, et autres
Publié: (2024)
Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
par: Zhu, Zhihan, et autres
Publié: (2024)
par: Zhu, Zhihan, et autres
Publié: (2024)
An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
par: Liang, Ling, et autres
Publié: (2024)
par: Liang, Ling, et autres
Publié: (2024)
Topological structure and a polynomial-time solution of linear programming over the real numbers
par: Wei, Jing-Yuan
Publié: (2018)
par: Wei, Jing-Yuan
Publié: (2018)
A non-iterative polynomial algorithm for linear programming
par: Jing-Yuan, Wei
Publié: (2013)
par: Jing-Yuan, Wei
Publié: (2013)
Dimension-free estimators of gradients of functions with(out) non-independent variables
par: Lamboni, Matieyendou
Publié: (2025)
par: Lamboni, Matieyendou
Publié: (2025)
Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2025)
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2025)
Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
par: Wang, Alex L.
Publié: (2025)
par: Wang, Alex L.
Publié: (2025)
Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
par: Geremew, W., et autres
Publié: (2026)
par: Geremew, W., et autres
Publié: (2026)
A Projection-Free Method for Solving Convex Bilevel Optimization Problems
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2023)
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2023)
A Two-Phase Adaptive Balanced Penalty Method for Controllable Pareto Front Learning under Split Feasibility Conditions
par: Hoang, Nguyen Viet, et autres
Publié: (2026)
par: Hoang, Nguyen Viet, et autres
Publié: (2026)
Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
par: Burns, Matthew X., et autres
Publié: (2025)
par: Burns, Matthew X., et autres
Publié: (2025)
Alternating minimization for square root principal component pursuit
par: Deng, Shengxiang, et autres
Publié: (2024)
par: Deng, Shengxiang, et autres
Publié: (2024)
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
par: He, Chuan, et autres
Publié: (2023)
par: He, Chuan, et autres
Publié: (2023)
Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
par: Starnes, Andrew, et autres
Publié: (2023)
par: Starnes, Andrew, et autres
Publié: (2023)
Stochastic interior-point methods for smooth conic optimization with applications
par: He, Chuan, et autres
Publié: (2024)
par: He, Chuan, et autres
Publié: (2024)
Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias
par: Malitsky, Yura, et autres
Publié: (2025)
par: Malitsky, Yura, et autres
Publié: (2025)
Documents similaires
-
Improved global performance guarantees of second-order methods in convex minimization
par: Dvurechensky, Pavel, et autres
Publié: (2024) -
Barrier Algorithms for Constrained Non-Convex Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024) -
Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025) -
Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
par: Nesterov, Yurii
Publié: (2025) -
Kurdyka-Łojasiewicz exponent via Hadamard parametrization
par: Ouyang, Wenqing, et autres
Publié: (2024)