The alternating direction method of multipliers for finding the distance between ellipsoids
From MaRDI portal
Publication:2244162
DOI10.1016/j.amc.2021.126387zbMath1497.65046arXiv2011.08933OpenAlexW3099353532MaRDI QIDQ2244162
Publication date: 11 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.08933
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (2)
The subdifferential descent method in a nonsmooth variational problem ⋮ Application of the subdifferential descent method to a classical nonsmooth variational problem
Uses Software
Cites Work
- Unnamed Item
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- Comparison of several fast algorithms for projection onto an ellipsoid
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- Unified theory of augmented Lagrangian methods for constrained global optimization
- Computation of the distance from an ellipsoid to a linear surface and a quadric in \(\mathbb R^n\)
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Charged ball method for solving some computational geometry problems
- Point-to-ellipse and point-to-ellipsoid distance equation analysis
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- ADMM for monotone operators: convergence analysis and rates
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- Computing the Signed Distance Between Overlapping Ellipsoids
- Distance Evaluation Between an Ellipse and an Ellipsoid
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- Convergence properties of augmented Lagrangian methods for constrained global optimization
- Decentralized Dynamic Optimization Through the Alternating Direction Method of Multipliers
- On the Distance between Two Ellipsoids
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Finding the distance between ellipsoids
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
- Practical Augmented Lagrangian Methods for Constrained Optimization
This page was built for publication: The alternating direction method of multipliers for finding the distance between ellipsoids
