Discrete geometry and optimization
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Convex sets in (3) dimensions (including convex surfaces) (52A15) Three-dimensional polytopes (52B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- Linear complementarity as absolute value equation solution
- Generalized Perron Roots and Solvability of the Absolute Value Equation
- Absolute value equation solution via concave minimization
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- A DC algorithm for solving non-uniquely solvable absolute value equations
This page was built for publication: Discrete geometry and optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631268)