Sensitivity analysis and tailored design of minimization diagrams
From MaRDI portal
Publication:6133444
DOI10.1090/mcom/3839zbMath1520.49021arXiv2112.08160MaRDI QIDQ6133444
Tiago C. Menezes, Antoine Laurain, Ernesto G. Birgin
Publication date: 18 August 2023
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08160
Nonsmooth analysis (49J52) Optimization of shapes other than minimal surfaces (49Q10) Sensitivity analysis for optimization problems on manifolds (49Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Voronoi diagrams and arrangements
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Concrete and abstract Voronoi diagrams
- Nonlinear multiobjective optimization
- Shape variation and optimization. A geometrical analysis
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- A damped Newton algorithm for generated Jacobian equations
- Optimal transport: discretization and algorithms
- Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials
- Distributed and boundary expressions of first and second order shape derivatives in nonsmooth domains
- Convergence of a Newton algorithm for semi-discrete optimal transport
- Distributed shape derivativeviaaveraged adjoint method and applications
- Shapes and Geometries
- Advances in Studies and Applications of Centroidal Voronoi Tessellations
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Reentrant polygon clipping
- The Shapes of Things
- Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Two-Point Step Size Gradient Methods
- GEOMPACK — a software package for the generation of meshes using geometric algorithms
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Analyzing Smooth and Singular Domain Perturbations in Level Set Methods
- An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
- Centroidal Voronoi Tessellations: Applications and Algorithms
- A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls
- An inverse problem for Voronoi diagrams: A simplified model of non‐destructive testing with ultrasonic arrays
- A Shape-Newton Approach to the Problem of Covering with Identical Balls
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Complexity and performance of an Augmented Lagrangian algorithm
