Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
From MaRDI portal
Recommendations
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- An interior-point approach to sensitivity analysis in degenerate linear programs
- Approaches to sensitivity analysis in linear programming
- Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Sensitivity analysis in linear semi-infinite programming via partitions
- Sensitivity analysis in convex programming
- ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING
- Sensitivity analysis for non-linear programs with linear constraints
- Local sensitivity analysis for linear programs based on semismooth equations
Cited in
(17)- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- A sensitivity result for semidefinite programs.
- An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Two optimal value functions in parametric conic linear programming
- An -sensitivity analysis for semidefinite programming
- Phase recovery, MaxCut and complex semidefinite programming
- Sensitivity analysis in bilevel linear programming
- An interior-point approach to sensitivity analysis in degenerate linear programs
- Maximum divert for planetary landing using convex optimization
- scientific article; zbMATH DE number 764459 (Why is no real title available?)
- Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
- Some observations on the perturbation of the vectors b and c in a linear programming problem.
- Parametric analysis of semidefinite optimization
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- On sensitivity of central solutions in semidefinite programming
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm
This page was built for publication: Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935708)