Interior point techniques in optimization. Complementarity, sensitivity and algorithms
sensitivitysemidefinite programmingcomplementaritypolynomial complexitysmallest eigenvalueduality theorylinear complementaritynonlinear complementarityinterior point techniquesprimal-dual Dikin-affine scaling algorithmtarget-following approach
Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- Long-step interior-point algorithms for a class of variational inequalities with monotone operators
- On the complexity of a combined homotopy interior method for convex programming
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- LPAKO: A Simplex-based Linear Programming Program
- scientific article; zbMATH DE number 1047684 (Why is no real title available?)
- Examples of ill-behaved central paths in convex optimization
- A new primal-dual interior-point algorithm for convex quadratic optimization
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Multimodal image registration by elastic matching of edge sketches via optimal control
This page was built for publication: Interior point techniques in optimization. Complementarity, sensitivity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1353364)
