On the resolution of certain discrete univariate max-min problems
DOI10.1007/s10589-017-9903-zzbMath1406.90126OpenAlexW2592680174MaRDI QIDQ2401027
Publication date: 31 August 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9903-z
nonsmooth optimizationmesh optimizationpolynomial rootsquasiconvex optimizationmesh smoothingdiscrete minimax
Minimax problems in mathematical programming (90C47) Numerical optimization and variational techniques (65K10) Existence of solutions for minimax problems (49J35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Real polynomials: location of zeros (26C10)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Principal compliance and robust optimal design
- On discrete minimax problems in \(\mathbb{R}\) using interval arithmetic
- Algebraic Mesh Quality Metrics
- Generalized Convexity, Nonsmooth Variational Inequalities, and Nonsmooth Optimization
- Computing Real Roots of Real Polynomials ... and now For Real!
- On Mesh Geometry and Stiffness Matrix Conditioning for General Finite Element Spaces
- Smooth Optimization Methods for Minimax Problems
- Mesh relaxation: A new technique for improving triangulations
- Optimal Point Placement for Mesh Smoothing
- On the Shape of Tetrahedra from Bisection
- Mesh Smoothing Using A Posteriori Error Estimates
- The quickhull algorithm for convex hulls
- Analysis of triangle quality measures
- Provably Robust Directional Vertex Relaxation for Geometric Mesh Optimization
- Polynomial Roots from Companion Matrix Eigenvalues
- A Review of Quasi-Convex Functions
- Smoothing method for minimax problems
This page was built for publication: On the resolution of certain discrete univariate max-min problems
