Cover Image

An acceleration technique for methods for finding the nearest point in a polytope and computing the distance between two polytopes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Dolgopolik, M. V.
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On approximating the nearest Ω-stable matrix
by: Choudhary, Neelam, et al.
Published: (2019)

Finding the nearest bounded-real port-Hamiltonian system
by: Cherifi, Karim, et al.
Published: (2025)

Anderson-type acceleration method for Deep Neural Network optimization
by: Ito, Kazufumi, et al.
Published: (2025)

Computing the nearest $Ω$-admissible descriptor dissipative Hamiltonian system
by: Aggarwal, Vaishali, et al.
Published: (2025)

An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
by: Luo, Hao, et al.
Published: (2025)

Numerical computation of generalized Wasserstein distances with applications to traffic model analysis
by: Briani, Maya, et al.
Published: (2024)

On a fixed-point continuation method for a convex optimization problem
by: Fest, Jean-Baptiste, et al.
Published: (2022)

Reduced order method based Anderson-type acceleration method for nonlinear least square problems and large scale ill-posed problems
by: Ito, Kazufumi, et al.
Published: (2025)

Tensor-based Dinkelbach method for computing generalized tensor eigenvalues and its applications
by: Chen, Haibin, et al.
Published: (2025)

Optimal local linear convergence of Nesterov's accelerated gradient method for $C^2$ functions under the Polyak--Łojasiewicz inequality
by: Feng, Zixu, et al.
Published: (2026)

An augmented Lagrangian trust-region method with inexact gradient evaluations to accelerate constrained optimization problems using model hyperreduction
by: Wen, Tianshu, et al.
Published: (2024)

A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems
by: Dong, Yakun, et al.
Published: (2022)

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
by: Andrews, Roland, et al.
Published: (2025)

Numerical analysis of a first-order computational algorithm for reaction-diffusion equations via the primal-dual hybrid gradient method
by: Liu, Shu, et al.
Published: (2024)

Comparison of two numerical methods for Riemannian cubic polynomials on Stiefel manifolds
by: Simoes, Alexandre Anahory, et al.
Published: (2024)

Levenberg-Marquardt method with Singular Scaling and applications
by: Boos, Everton, et al.
Published: (2023)

New complementarity formulations for root-finding and optimization of piecewise-affine functions in abs-normal form
by: Zhang, Yulan, et al.
Published: (2025)

A novel dual-decomposition method for non-convex two-stage stochastic mixed-integer quadratically constrained quadratic problems
by: Belyak, Nikita, et al.
Published: (2023)

The latent variable proximal point algorithm for variational problems with inequality constraints
by: Dokken, Jørgen S., et al.
Published: (2025)

Subspace power method for symmetric tensor decomposition
by: Kileel, Joe, et al.
Published: (2019)

Phase field approximation for Plateau's problem: a curve geodesic distance penalty approach
by: Bonnivard, Matthieu, et al.
Published: (2025)

Adaptive Weighted Total Variation boosted by learning techniques in few-view tomographic imaging
by: Morotti, Elena, et al.
Published: (2025)

Polygonal Faber-Krahn inequality: Local minimality via validated computing
by: Bogosel, Beniamin, et al.
Published: (2024)

A comparison study of supervised learning techniques for the approximation of high dimensional functions and feedback control
by: Oster, Mathias, et al.
Published: (2024)

Eigenvalue bounds for preconditioned symmetric multiple saddle-point matrices
by: Bergamaschi, L., et al.
Published: (2025)

Extended-Krylov-subspace methods for trust-region and norm-regularization subproblems
by: Daas, Hussam Al, et al.
Published: (2025)

Creating walls to avoid unwanted points in root finding and optimization
by: Truong, Tuyen Trung
Published: (2023)

Numerical method for approximately optimal solutions of two-stage distributionally robust optimization with marginal constraints
by: Neufeld, Ariel, et al.
Published: (2022)

Proximal Galerkin: A structure-preserving finite element method for pointwise bound constraints
by: Keith, Brendan, et al.
Published: (2023)

Particle method for a nonlinear multimarginal optimal transport problem
by: Cances, Adrien, et al.
Published: (2026)

Level-set shape optimization via polytopic discontinuous Galerkin methods
by: Fernandes, Raphael S., et al.
Published: (2024)

Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
by: Cartis, Coralia, et al.
Published: (2023)

A perturbed preconditioned gradient descent method for the unconstrained minimization of composite objectives
by: Park, Jea-Hyun, et al.
Published: (2025)

Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation
by: Kraria, Aicha, et al.
Published: (2024)

GPU-accelerated FREDopt package for simultaneous dose and LETd proton radiotherapy plan optimization via superiorization methods
by: Borys, Damian, et al.
Published: (2025)

Characterizing and computing solutions to regularized semi-discrete optimal transport via an ordinary differential equation
by: Nenna, Luca, et al.
Published: (2025)

Optimization methods for solving matrix equations
by: Zhang, Juan, et al.
Published: (2024)

Nonlinear preconditioned primal-dual method for a class of structured minimax problems
by: Zhang, Lu, et al.
Published: (2024)

Convergence of a particle method for gradient flows on the $L^p$-Wasserstein space
by: Lei, Rong
Published: (2025)

Bioluminescence tomography via a shape optimization method based on a complex-valued model
by: Wu, Qianqian, et al.
Published: (2025)