Finding elliptic Fekete points sets: Two numerical solution approaches
numerical examplesdifferential-algebraic equationsLipschitz global optimizationindex 2elliptic Fekete pointsIVP algorithmsLGO program system
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical methods for differential-algebraic equations (65L80) Implicit ordinary differential equations, differential-algebraic equations (34A09) Inequalities and extremum problems involving convexity in convex geometry (52A40) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
- scientific article; zbMATH DE number 1343008
- An ellipsoid algorithm for the computation of fixed points
- Numerical solution for bounding feasible point sets
- Numerical and geometric properties of a method for finding points on real solution components
- On the lattice point problem for ellipsoids
- An algorithm to determine the points with integral coordinates in certain elliptic curves
- On the lattice point problem for ellipsoids
- Circumscribed ellipsoid algorithm for fixed-point problems
- Finding sets covering a point with application to mesh-free Galerkin methods
- Computing Fekete and Lebesgue points: Simplex, square, disk
- scientific article; zbMATH DE number 3143008 (Why is no real title available?)
- scientific article; zbMATH DE number 44365 (Why is no real title available?)
- scientific article; zbMATH DE number 1058961 (Why is no real title available?)
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- An open global optimization problem on the unit sphere
- Complexity of Bezout's theorem. III: Condition number and packing
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Hecke operators and distributing points on the sphere I
- One-dimensional nested maximin designs
- Benchmarking nonlinear optimization software in technical computing environments
- Optimal logarithmic energy points on the unit sphere
- Optimized ellipse packings in regular polygons
- Nonlinear optimization with GAMS /LGO
- Computational cost of the Fekete problem. I: The forces method on the 2-sphere
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- On 7th Smale's problem
- Estimation of Fekete points
- Localized Spot Patterns on the Sphere for Reaction-Diffusion Systems: Theory and Open Problems
- Global Optimization in Practice:State of the Art and Perspectives
- An overdetermined B-spline collocation method for Poisson problems on complex domains
- The Stability and Slow Dynamics of Localized Spot Patterns for the 3-D Schnakenberg Reaction-Diffusion Model
- Model development and solver demonstrations using randomized test problems
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- A complete solution to the equichordal point problem of Fujiwara, Blaschke, Rothe and Weizenböck
- Harmonic properties of the logarithmic potential and the computability of elliptic Fekete points
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- A new series of conjectures and open questions in optimization and matrix analysis
This page was built for publication: Finding elliptic Fekete points sets: Two numerical solution approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937187)
