The following pages link to (Q4324980):
Displaying 50 items.
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming (Q1290605) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- Affine scaling algorithm fails for semidefinite programming (Q1290670) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- On parametric semidefinite programming (Q1294552) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
- Problems of distance geometry and convex properties of quadratic maps (Q1346137) (← links)
- Inversion error, condition number, and approximate inverses of uncertain matrices (Q1348090) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- Volumetric path following algorithms for linear programming (Q1361113) (← links)
- \(H_ \infty\) control for descriptor systems: A matrix inequalities approach (Q1361328) (← links)
- Measure concentration in optimization (Q1365046) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Modified primal path-following scheme for the monotone variational inequality problem (Q1372549) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- Dynamic balance of segregation distortion and selection maintains normal allele sizes at the myotonic dystrophy locus (Q1381373) (← links)
- Euclidean Jordan algebras and interior-point algorithms (Q1383772) (← links)
- The discrete algebraic Riccati equation and linear matrix inequality (Q1386508) (← links)
- On some properties of generalized proximal point methods for variational inequalities (Q1389080) (← links)
- An efficient off-line formulation of robust model predictive control using linear matrix inequalities (Q1400317) (← links)
- Scaling symmetric positive definite matrices to prescribed row sums. (Q1405034) (← links)
- Elliptic and hyperbolic quadratic eigenvalue problems and associated distance problems. (Q1406280) (← links)
- On the complexity of the primal self-concordant barrier method. (Q1412708) (← links)
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes. (Q1413940) (← links)
- Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- LMI-based robust stability analysis for fuzzy feedback linearization regulators with its appli\-ca\-tions. (Q1425270) (← links)
- Inner and outer approximations of polytopes using boxes. (Q1428115) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- A projection scheme to stability analysis of discrete T-S fuzzy models. (Q1428714) (← links)
- Multiobjective duality for convex semidefinite programming problems (Q1431149) (← links)
- Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (Q1572590) (← links)
- Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities (Q1573993) (← links)
- Convex preserving scattered data interpolation using bivariate \(C^1\) cubic splines (Q1576461) (← links)
- Minimal representation of convex regions defined by analytic functions (Q1577971) (← links)
- On weighted centers for semidefinite programming (Q1584796) (← links)
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
- Piecewise linear methods for nonlinear equations and optimization (Q1593829) (← links)
- Interior-point methods (Q1593831) (← links)
- An SQP method for general nonlinear complementarity problems (Q1595262) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Nonnegative minimum biased quadratic estimation in mixed linear models (Q1599237) (← links)
