:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Aragón-Artacho, Francisco J., Bauschke, Heinz H., López-Pastor, César
Format:	Preprint
Published:	2025
Subjects:	General Mathematics 90C25, 12D10, 26C10, 90C26
Online Access:	https://arxiv.org/abs/2512.22546
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exploiting Sparsity in Complex Polynomial Optimization
by: Wang, Jie, et al.
Published: (2021)

Splitting the Conditional Gradient Algorithm
by: Woodstock, Zev, et al.
Published: (2023)

On Carlier's inequality
by: Bauschke, Heinz H., et al.
Published: (2022)

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

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

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

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

A Simple Trigonometric Classification of Quartic Roots
by: Pratiher, Sawon
Published: (2026)

Graph splitting methods: Fixed points and strong convergence for linear subspaces
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

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

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

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

Beyond binarity: Semidefinite programming for ternary quadratic problems
by: de Meijer, Frank, et al.
Published: (2026)

On Opial's Lemma
by: Arakcheev, Aleksandr, et al.
Published: (2025)

Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
by: Cortild, Daniel, et al.
Published: (2026)

Bilevel Learning via Inexact Stochastic Gradient Descent
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

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

Forward-backward algorithms devised by graphs
by: Aragón-Artacho, Francisco J., et al.
Published: (2024)

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

Multiobjective Programming and Weighting Scalar Problem
by: Ivanov, Vsevolod I.
Published: (2025)

More about solutions of quadratic equations
by: Richter, Wolf-Dieter
Published: (2025)

Refined TSSOS
by: Shaydurova, Daria, et al.
Published: (2024)

MAD Risk Parity Portfolios
by: Ararat, Çağın, et al.
Published: (2021)

Swarm-Based Gradient Descent Method for Non-Convex Optimization
by: Lu, Jingcheng, et al.
Published: (2022)

Swarm-based optimization with random descent
by: Tadmor, Eitan, et al.
Published: (2023)

Swarm-based gradient descent meets simulated annealing
by: Ding, Zhiyan, et al.
Published: (2024)

Bivariate rational approximations of the general temperature integral
by: Aghili, Alireza, et al.
Published: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

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

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
by: Dahl, Simeon vom, et al.
Published: (2026)

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

A Riemannian Accelerated Proximal Gradient Method
by: Feng, Shuailing, et al.
Published: (2025)

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

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

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

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
by: László, Szilárd Csaba
Published: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
by: Selicato, Laura, et al.
Published: (2025)

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
by: Zhang, Hu, et al.
Published: (2022)

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
by: Liu, Zekun
Published: (2024)