Copertina

Projection onto the parabola

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Aragón-Artacho, Francisco J., Bauschke, Heinz H., López-Pastor, César
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	General Mathematics 90C25, 12D10, 26C10, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Splitting the Conditional Gradient Algorithm
di: Woodstock, Zev, 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 Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

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

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

Cutting planes for signomial programming
di: Xu, Liding, et al.
Pubblicazione: (2022)

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

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)

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

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

A Simple Trigonometric Classification of Quartic Roots
di: Pratiher, Sawon
Pubblicazione: (2026)

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

Multiobjective Programming and Weighting Scalar Problem
di: Ivanov, Vsevolod I.
Pubblicazione: (2025)

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

More about solutions of quadratic equations
di: Richter, Wolf-Dieter
Pubblicazione: (2025)

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

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

Refined TSSOS
di: Shaydurova, Daria, et al.
Pubblicazione: (2024)

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

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

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

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

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)

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

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

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

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
di: Arima, Naohiko, et al.
Pubblicazione: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

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