Copertina

Grassmannian optimization is NP-hard

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lai, Zehua, Lim, Lek-Heng, Ye, Ke
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Numerical Analysis 03D15, 90C26, 90C23, 65K10, 68Q25, 90C60
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Stiefel optimization is NP-hard
di: Lai, Zehua, et al.
Pubblicazione: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
di: Monteiro, Renato D. C., et al.
Pubblicazione: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
di: Hua, Zheng, et al.
Pubblicazione: (2021)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
di: He, Chuan, et al.
Pubblicazione: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
di: Aguirre, Jacob M., et al.
Pubblicazione: (2025)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
di: Yuan, Ya-xiang, et al.
Pubblicazione: (2024)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
di: Kong, Weiwei
Pubblicazione: (2022)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
di: Aguirre, Jacob, et al.
Pubblicazione: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
di: Ouyang, Wenqing, et al.
Pubblicazione: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
di: Ouyang, Wenqing
Pubblicazione: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
di: Krejić, Nataša, et al.
Pubblicazione: (2025)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
di: Nandhan, Navil, et al.
Pubblicazione: (2026)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
di: Yoon, TaeHo, et al.
Pubblicazione: (2026)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
di: Sujanani, Arnesh, et al.
Pubblicazione: (2024)

Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods
di: Adcock, Ben, et al.
Pubblicazione: (2023)

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
di: Lu, Zhaosong, et al.
Pubblicazione: (2024)

Optimization in Theory and Practice
di: Wright, Stephen J.
Pubblicazione: (2025)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
di: Fest, Jean-Baptiste, et al.
Pubblicazione: (2023)

Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
di: Beddrich, Jonas, et al.
Pubblicazione: (2024)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
di: Jung, Woosuk L., et al.
Pubblicazione: (2023)

On the Curvature of the Central Path of Linear Programming Theory
di: Dedieu, Jean-Pierre, et al.
Pubblicazione: (2003)

Multivariate approximation by polynomial and generalised rational functions
di: Millán, R. Díaz, et al.
Pubblicazione: (2021)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
di: Deng, Kangkang, et al.
Pubblicazione: (2025)

Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
di: Borghi, Giacomo, et al.
Pubblicazione: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
di: Bot, Radu Ioan, et al.
Pubblicazione: (2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
di: Chen, Xiaojun, et al.
Pubblicazione: (2022)

Policy Optimization over General State and Action Spaces
di: Ju, Caleb, et al.
Pubblicazione: (2022)

Performance Estimation of second-order optimization methods on classes of univariate functions
di: Rubbens, Anne, et al.
Pubblicazione: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
di: Takahashi, Shota, et al.
Pubblicazione: (2025)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
di: Hu, Wei, et al.
Pubblicazione: (2026)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates
di: Esposito, Flavia, et al.
Pubblicazione: (2025)

An adaptive framework for first-order gradient methods
di: Hu, Xiaozhe, et al.
Pubblicazione: (2026)

Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
di: Chen, Jiaxin, et al.
Pubblicazione: (2024)

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
di: Zhao, Lei, et al.
Pubblicazione: (2025)

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

Convergence analysis of the transformed gradient projection algorithms on compact matrix manifolds
di: Ding, Wentao, et al.
Pubblicazione: (2024)