Cover Image

Distance geometry with and without the graph

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liberti, Leo, Lavor, Carlile
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Metric Geometry 90C26, 51K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
by: Song, Mengmeng, et al.
Published: (2024)

Unassigned distance geometry and the Buckminsterfullerene
by: Liberti, Leo
Published: (2024)

Some New Insights from Highly Optimized Polyhedral Passages
by: Gosain, Raj, et al.
Published: (2025)

Obtuse almost-equiangular sets
by: Bachoc, Christine, et al.
Published: (2025)

Single Element Error Correction/ in a Euclidean Distance Matrix
by: Alfakih, Abdo, et al.
Published: (2024)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
by: Alpay, Faruk, et al.
Published: (2025)

Optimization hierarchies for distance-avoiding sets in compact spaces
by: Bekker, Bram, et al.
Published: (2023)

Characterizing nonconvex boundaries via scalarization
by: Ma, Jin, et al.
Published: (2025)

Local geometry of feasible regions via smooth paths
by: Lewis, Adrian S., et al.
Published: (2024)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
by: Heeman, Pim, et al.
Published: (2025)

A semidefinite programming hierarchy for covering problems in discrete geometry
by: Riener, Cordian, et al.
Published: (2023)

Local Convergence of Adaptively Regularized Tensor Methods
by: Welzel, Karl, et al.
Published: (2025)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
by: Gfrerer, H.
Published: (2024)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
by: Kannan, Rohit, et al.
Published: (2022)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
by: Xie, Xiyuan, et al.
Published: (2026)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Forward-Backward algorithms for weakly convex problems
by: Bednarczuk, Ewa, et al.
Published: (2023)

Peeling metric spaces of strict negative type
by: Huntsman, Steve
Published: (2025)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)

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

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)

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

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024)

An Augmented Lagrangian Method for Training Recurrent Neural Networks
by: Wang, Yue, et al.
Published: (2024)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
by: Engquist, Björn, et al.
Published: (2022)

Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)