Image de couverture de livre

Single Element Error Correction/ in a Euclidean Distance Matrix

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Alfakih, Abdo, Jung, Woosuk L., Wolkowicz, Henry, Xu, Tina
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 51K05, 90C26, 90C46, 65K10, 15A48, 90C22
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
par: Song, Mengmeng, et autres
Publié: (2024)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

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

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
par: Zhu, Daoli, et autres
Publié: (2023)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
par: Li, Wenjing, et autres
Publié: (2023)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
par: Brosch, Daniel, et autres
Publié: (2025)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
par: Fest, Jean-Baptiste, et autres
Publié: (2023)

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
par: Zhao, Lei, et autres
Publié: (2025)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
par: Renani, Neda Bagheri, et autres
Publié: (2025)

Forward-Backward algorithms for weakly convex problems
par: Bednarczuk, Ewa, et autres
Publié: (2023)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
par: Li, Luxuan, et autres
Publié: (2026)

Splitting the Conditional Gradient Algorithm
par: Woodstock, Zev, et autres
Publié: (2023)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
par: Chen, Xiaojun, et autres
Publié: (2022)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

Implementing a unified solver for nonlinearly constrained optimization
par: Vanaret, Charlie, et autres
Publié: (2024)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
par: Nandhan, Navil, et autres
Publié: (2026)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
par: Krejić, Nataša, et autres
Publié: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
par: Selicato, Laura, et autres
Publié: (2025)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
par: Niu, Yi-Shuai, et autres
Publié: (2018)

Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
par: Cortild, Daniel, et autres
Publié: (2026)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
par: Heeman, Pim, et autres
Publié: (2025)

Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees
par: Gao, Sarah Yini, et autres
Publié: (2026)

Bivariate rational approximations of the general temperature integral
par: Aghili, Alireza, et autres
Publié: (2024)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
par: Engquist, Björn, et autres
Publié: (2022)

Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
par: Chen, Jiaxin, et autres
Publié: (2024)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

On the role of semismoothness in nonsmooth numerical analysis: Theory
par: Gfrerer, H., et autres
Publié: (2024)

On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
par: Gfrerer, Helmut, et autres
Publié: (2024)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
par: Scheinberg, Katya, et autres
Publié: (2023)

An Inexact Regularized Proximal Newton Method without Line Search
par: Dahl, Simeon vom, et autres
Publié: (2024)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
par: Jin, Ruinan, et autres
Publié: (2026)

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

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
par: Dahl, Simeon vom, et autres
Publié: (2026)

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

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)