The following pages link to (Q3236242):
Displayed 50 items.
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory (Q341409) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- Conic formulation for \(l_p\)-norm optimization (Q702372) (← links)
- Unifying optimal partition approach to sensitivity analysis in conic optimization (Q702383) (← links)
- Error bounds for nondegenerate monotone linear complementarity problems (Q753691) (← links)
- Lineare Programme und allgemeine Vertretersysteme (Q774107) (← links)
- Identifying the optimal partition in convex quadratic programming (Q924889) (← links)
- Convergence of the homotopy path for a full-Newton step infeasible interior-point method (Q969524) (← links)
- Partitioning multiple objective optimal solutions with applications in radiotherapy design (Q1027150) (← links)
- A geometrie representation for pairs of dual quadratic or linear programs (Q1131454) (← links)
- An orderfield property for stochastic games when one player controls transition probabilities (Q1135219) (← links)
- Homogeneous programming and symmetrization (Q1173008) (← links)
- Minimum principle sufficiency (Q1198327) (← links)
- A saddlepoint theorem for self-dual linear systems (Q1215686) (← links)
- On the uncertainties transmitted from premises to conclusions in deductive inferences (Q1217702) (← links)
- Sensitivity analysis in linear programming: Just be careful! (Q1278928) (← links)
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces (Q1290608) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Implied constraints and a unified theory of duality in linear and nonlinear programming (Q1319546) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) (← links)
- Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
- The asymptotic optimal partition and extensions of the nonsubstitution theorem (Q1765893) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
- On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method (Q1816897) (← links)
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods (Q1919814) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Limit laws for empirical optimal solutions in random linear programs (Q2159558) (← links)
- A rounding procedure for semidefinite optimization (Q2294267) (← links)
- Minmax and duality in nonlinear programming (Q2395157) (← links)
- A complementarity partition theorem for multifold conic systems (Q2434990) (← links)
- On the uniqueness of optimal strategies in symmetric matrix games (Q2451671) (← links)
- Generation of degenerate linear programming problems (Q2483038) (← links)
- Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces (Q2522488) (← links)
- Duality in nonlinear programming and the minimax theorem (Q2525909) (← links)
- Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs) (Q2531202) (← links)
- An economic interpretation of duality in linear programming (Q2538772) (← links)
- Theory of majority decision elements (Q2539620) (← links)
- On duality for real and complex programming problems (Q2545059) (← links)
- Existence theory for the complex linear complementarity problem (Q2545665) (← links)