Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Presolving in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Real-World Linear Programs: A Decade and More of Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and Degeneracy in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The central path visits all the vertices of the Klee–Minty cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on alternating projections for ill-posed semidefinite feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual active-set methods for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an Extension of Condition Number Theory to Nonconic Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable primal-dual approach for linear programming under nondegeneracy assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Performance Profiles for Benchmarking Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy in interior point methods for linear programming: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened Barvinok-Pataki bound on SDP rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on degeneracy in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced preprocessing techniques for linear and quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perturbation theory for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of highly degenerate linear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank revealing Gaussian elimination by the maximum volume concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds and Singularity Degree in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Linear Matrix Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot rules for linear programming: A survey on recent theoretical developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Method for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank

Latest revision as of 16:01, 1 August 2024

scientific article; zbMATH DE number 7709830
Language Label Description Also known as
English
Revisiting degeneracy, strict feasibility, stability, in linear programming
scientific article; zbMATH DE number 7709830

    Statements

    Revisiting degeneracy, strict feasibility, stability, in linear programming (English)
    0 references
    0 references
    0 references
    11 July 2023
    0 references
    linear programming
    0 references
    facial reduction
    0 references
    preprocessing
    0 references
    degeneracy
    0 references
    implicit problem singularity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers