The following pages link to Tamás Terlaky (Q172148):
Displaying 50 items.
- (Q217003) (redirect page) (← links)
- Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron (Q255394) (← links)
- An analogue of the Klee-Walkup result for sonnevend's curvature of the central path (Q289062) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384507) (← links)
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- On the volumetric path (Q691484) (← links)
- Conic formulation for \(l_p\)-norm optimization (Q702372) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- Generalized support set invariancy sensitivity analysis in linear optimization (Q873702) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- Polytopes and arrangements: diameter and curvature (Q935228) (← links)
- Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (Q940836) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
- Comments on ``Dual methods for nonconvex spectrum optimization of multicarrier systems'' (Q941043) (← links)
- The colourful feasibility problem (Q944700) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Active constraint set invariancy sensitivity analysis in linear optimization (Q946305) (← links)
- Efficient preprocessing for VLSI optimization problems (Q967209) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- EP theorem for dual linear complementarity problems (Q1016385) (← links)
- A continuous \(d\)-step conjecture for polytopes (Q1017920) (← links)
- New stopping criteria for detecting infeasibility in conic optimization (Q1024728) (← links)
- A confidence voting process for ranking problems based on support vector machines (Q1026549) (← links)
- Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design (Q1026924) (← links)
- On \(\ell_ p\) programming (Q1065711) (← links)
- A finite crisscross method for oriented matroids (Q1073036) (← links)
- A new algorithm for quadratic programming (Q1097172) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- Linearly constrained estimation by mathematical programming (Q1262209) (← links)
- A nonconvex weighted potential function for polynomial target following methods (Q1265911) (← links)
- Sensitivity analysis in linear programming: Just be careful! (Q1278928) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Pseudoconvex optimization for a special problem of paint industry (Q1342653) (← links)
- Optimization of nuclear reactor reloading patterns (Q1357771) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Inverse barriers and CES-functions in linear programming (Q1374380) (← links)
