Imagen de Portada

An algorithm for minimum cardinality generators of cones

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mayer, Matthias Georg, von der Warth, Fabian
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90C25
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
por: Sakabe, Keiya
Publicado: (2026)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
por: Dahl, Joachim, et al.
Publicado: (2025)

A symmetric primal-dual algorithmic framework for saddle point problems
por: He, Hongjin, et al.
Publicado: (2022)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
por: Yang, Yaguang
Publicado: (2022)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
por: Papp, Dávid, et al.
Publicado: (2025)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
por: Mazanti, Guilherme, et al.
Publicado: (2024)

Properties of the complementarity set for the cone of copositive matrices
por: Kostyukova, O. I.
Publicado: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
por: Nishioka, Akatsuki, et al.
Publicado: (2023)

Sparsification of sums with respect to convex cones
por: Saunderson, James
Publicado: (2025)

Dual certificates of primal cone membership
por: Lee, Joonyeob, et al.
Publicado: (2025)

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

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
por: Xia, Yong, et al.
Publicado: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
por: Zhu, Zhihan, et al.
Publicado: (2024)

Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
por: Shen, Ya, et al.
Publicado: (2025)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
por: Kharitenko, Andrey, et al.
Publicado: (2025)

A high-order augmented Lagrangian method with arbitrarily fast convergence
por: Lee, Young-Ju, et al.
Publicado: (2026)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
por: Xu, Xin
Publicado: (2025)

Local and Global Convergence of Greedy Parabolic Target-Following Methods for Linear Programming
por: Nesterov, Yurii
Publicado: (2024)

Convexoid: A Minimal Theory of Conjugate Convexity
por: Wei, Ningji
Publicado: (2024)

Exponential Conic Relaxations for Signomial Geometric Programming
por: Filabadi, Milad Dehghani, et al.
Publicado: (2024)

The Power of Extrapolation in Federated Learning
por: Li, Hanmin, et al.
Publicado: (2024)

On Convergence and Stability of Two Extended BB-like Step Sizes
por: Xu, Xin
Publicado: (2025)

Stabilized Proximal Point Method via Trust Region Control
por: Li, Hanmin, et al.
Publicado: (2026)

Convex quartic problems: homogenized gradient method and preconditioning
por: Dragomir, Radu-Alexandru, et al.
Publicado: (2023)

On the geometry of circumcentric directions of cones
por: Bello-Cruz, Yunier
Publicado: (2026)

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

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
por: Nesterov, Yurii
Publicado: (2025)

Kurdyka-Łojasiewicz exponent via square transformation
por: Ouyang, Wenqing
Publicado: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
por: Zhang, Liwei, et al.
Publicado: (2025)

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
por: Tran-Dinh, Quoc
Publicado: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
por: Namchaisiri, Charles, et al.
Publicado: (2024)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
por: Tang, Tianyun, et al.
Publicado: (2024)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
por: Xu, Xin
Publicado: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
por: Namchaisiri, Charles, et al.
Publicado: (2024)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
por: Marumo, Hiroki, et al.
Publicado: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
por: Hou, Di, et al.
Publicado: (2025)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
por: Hou, Di, et al.
Publicado: (2023)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
por: Nesterov, Yurii
Publicado: (2025)