Data loci in algebraic optimization
From MaRDI portal
conormal varietyconstrained critical pointsdual varietyEuclidean distance degreemaximum likelihood degreeparametric optimization
Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Determinantal varieties (14M12) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Computational aspects in algebraic geometry (14Q99) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Recommendations
- Algebraic optimization: The Fermat-Weber location problem
- Data based algorithmic algebra
- scientific article; zbMATH DE number 1273691
- Algebraic and Topological Tools in Linear Optimization
- scientific article; zbMATH DE number 3915531
- An algebraic formulation for data refinement
- scientific article; zbMATH DE number 7246283
- scientific article; zbMATH DE number 4143787
- Algebraic and geometric ideas in the theory of discrete optimization
- Optimal locations and inner products
Cites work
- An introduction to polynomial and semi-algebraic optimization
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Counting critical formations on a line
- Degrees of Kalman varieties of tensors
- Dualities
- Euclidean distance degree of the multiview variety
- Exact solutions in structured low-rank approximation
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Matrices with eigenvectors in a given subspace
- Solving parametric polynomial systems
- The data singular and the data isotropic loci for affine cones
- The Euclidean distance degree of an algebraic variety
- The maximum likelihood data singular locus
Cited in
(9)- Critical points via monodromy and local methods
- Algebraic degree of polynomial optimization
- Data loci in algebraic optimization
- Osculating geometry and higher-order distance loci
- Decomposing tensors via rank-one approximations
- Conditional Euclidean distance optimization via relative tangency
- Algebraic degree of optimization over a variety with an application to P-norm distance degree
- Applications of singularity theory in applied algebraic geometry and algebraic statistics
- When does subtracting a rank-one approximation decrease tensor rank?
This page was built for publication: Data loci in algebraic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154277)