Image de couverture de livre

Kurdyka-Łojasiewicz exponent via square transformation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ouyang, Wenqing
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90C25, 90C26, 68Q25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
par: Ouyang, Wenqing, et autres
Publié: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
par: Rubbens, Anne, et autres
Publié: (2025)

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

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
par: Nesterov, Yurii
Publié: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
par: Geremew, W., et autres
Publié: (2026)

Barrier Algorithms for Constrained Non-Convex Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
par: Zhang, Chenyu, et autres
Publié: (2023)

Analysis of Kernel Mirror Prox for Measure Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
par: Gao, Yan, et autres
Publié: (2026)

Policy Optimization over General State and Action Spaces
par: Ju, Caleb, 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)

Improved global performance guarantees of second-order methods in convex minimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
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)

First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
par: Ivanov, Vsevolod I.
Publié: (2024)

Topological structure and a polynomial-time solution of linear programming over the real numbers
par: Wei, Jing-Yuan
Publié: (2018)

A non-iterative polynomial algorithm for linear programming
par: Jing-Yuan, Wei
Publié: (2013)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
par: Wu, Hanju, et autres
Publié: (2025)

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

A Riemannian Accelerated Proximal Gradient Method
par: Feng, Shuailing, et autres
Publié: (2025)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
par: Namchaisiri, Charles, et autres
Publié: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
par: Namchaisiri, Charles, et autres
Publié: (2024)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, et autres
Publié: (2024)

Alternating minimization for square root principal component pursuit
par: Deng, Shengxiang, et autres
Publié: (2024)

On the Hardness of the $L_1-L_2$ Regularization Problem
par: Ouyang, Yuyuan, et autres
Publié: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
par: Bot, Radu Ioan, et autres
Publié: (2024)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
par: Goerigk, Marc, et autres
Publié: (2026)

Grassmannian optimization is NP-hard
par: Lai, Zehua, et autres
Publié: (2024)

Multiobjective Programming and Weighting Scalar Problem
par: Ivanov, Vsevolod I.
Publié: (2025)

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

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

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
par: Arima, Naohiko, 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)

Stiefel optimization is NP-hard
par: Lai, Zehua, et autres
Publié: (2025)

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
par: Suvorikova, Alexandra, et autres
Publié: (2026)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
par: Prakhya, Karthik, et autres
Publié: (2026)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
par: Yang, Xiangyu, et autres
Publié: (2021)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
par: Yuan, Ya-xiang, et autres
Publié: (2024)