Imagen de Portada

Convex optimization on CAT(0) cubical complexes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Goodwin, Ariel, Lewis, Adrian S., Lopez-Acedo, Genaro, Nicolae, Adriana
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90C48, 52A41, 57Z25, 65K05 F.2.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Recognizing weighted means in geodesic spaces
por: Goodwin, Ariel, et al.
Publicado: (2024)

Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces
por: Goodwin, Ariel, et al.
Publicado: (2024)

A Generalized Heron-Waist Problem: Optimality Conditions and Convergence Analysis
por: Choudhary, Manohar, et al.
Publicado: (2026)

Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization
por: Alshahrani, Mohammed
Publicado: (2026)

Horoballs and the subgradient method
por: Lewis, Adrian S., et al.
Publicado: (2024)

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

An optimal lower bound for smooth convex functions
por: Florea, Mihai I., et al.
Publicado: (2024)

Error estimate for regularized optimal transport problems via Bregman divergence
por: Morikuni, Keiichi, et al.
Publicado: (2023)

Barrier relaxations of the classical and quantum optimal transport problems
por: Friedland, Shmuel
Publicado: (2025)

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

A template for gradient norm minimization
por: Florea, Mihai I.
Publicado: (2024)

Adaptive first-order methods with enhanced worst-case rates
por: Florea, Mihai I.
Publicado: (2024)

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

Expansions of the Characteristic Polynomial of a Perturbed Positive Semidefinite Matrix and Convergence Analysis of Alternating Projections
por: Ochiai, Hiroyuki, et al.
Publicado: (2024)

Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone
por: Ochiai, Hiroyuki, et al.
Publicado: (2024)

Analytic Formulas for Alternating Projection Sequences for the Positive Semidefinite Cone and an Application to Convergence Analysis
por: Ochiai, Hiroyuki, et al.
Publicado: (2024)

Minimal enclosing balls via geodesics
por: Goodwin, Ariel, et al.
Publicado: (2026)

Error Bounds for a Class of Cone-Convex Inclusion Problems
por: Huy, Nguyen Quang, et al.
Publicado: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
por: Ang, Andersen, et al.
Publicado: (2023)

Dynamic FISTA for Convex Composite Bi-Level Optimization
por: Merchav, Roey, et al.
Publicado: (2024)

Stable Recovery of Regularized Linear Inverse Problems
por: Nghia, Tran T. A., et al.
Publicado: (2024)

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence
por: Jung, Kiyuob, et al.
Publicado: (2024)

Hidden convexity, optimization, and algorithms on rotation matrices
por: Ramachandran, Akshay, et al.
Publicado: (2023)

Monomial barrier functions for the box-constrained convex optimization problems
por: Fayed, Hatem
Publicado: (2024)

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

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

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
por: Kabgani, Alireza, et al.
Publicado: (2025)

A Projected Variable Smoothing for Weakly Convex Optimization and Supremum Functions
por: López-Rivera, Sergio, et al.
Publicado: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
por: Kabgani, Alireza, et al.
Publicado: (2024)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
por: Ahookhosh, Masoud, et al.
Publicado: (2026)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
por: Yang, Xiangyu, et al.
Publicado: (2021)

Bregman proximal gradient method for linear optimization under entropic constraints
por: Briceño-Arias, Luis M., et al.
Publicado: (2025)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
por: Gu, Ran, et al.
Publicado: (2021)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
por: Wang, Haoning, et al.
Publicado: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
por: Zhang, Lu, et al.
Publicado: (2026)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
por: Mannel, Florian
Publicado: (2024)

An interior proximal gradient method for nonconvex optimization
por: De Marchi, Alberto, et al.
Publicado: (2022)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
por: Yuan, Ya-xiang, et al.
Publicado: (2023)

A Riemannian gradient descent method for optimization on the indefinite Stiefel manifold
por: Van Tiep, Dinh, et al.
Publicado: (2024)

Multi-material structural optimization for additive manufacturing based on a phase field approach
por: Blank, Luise, et al.
Publicado: (2025)