The following pages link to Tamás Terlaky (Q172148):
Displaying 50 items.
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity (Q3083311) (← links)
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems (Q3124039) (← links)
- Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions (Q3169080) (← links)
- (Q3198693) (← links)
- (Q3360010) (← links)
- The central path visits all the vertices of the Klee–Minty cube (Q3423600) (← links)
- (Q3428840) (← links)
- Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications (Q3454974) (← links)
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
- Mehrotra-type predictor-corrector algorithm revisited (Q3539794) (← links)
- On Mehrotra-Type Predictor-Corrector Algorithms (Q3544266) (← links)
- Bi-parametric convex quadratic optimization (Q3562397) (← links)
- On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization (Q3562415) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION (Q3636502) (← links)
- (Q3703176) (← links)
- A convergent criss-cross method (Q3703581) (← links)
- (Q3706831) (← links)
- (Q3710325) (← links)
- (Q3749071) (← links)
- (Q3768671) (← links)
- (Q3768919) (← links)
- (Q3777806) (← links)
- (Q3783068) (← links)
- (Q3831021) (← links)
- (Q3840328) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
- (Q3929409) (← links)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS (Q4018360) (← links)
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems (Q4018385) (← links)
- The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method (Q4035647) (← links)
- On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance (Q4229487) (← links)
- (Q4254537) (← links)
- A Monotonic Build-Up Simplex Algorithm for Linear Programming (Q4305758) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- (Q4339096) (← links)
- (Q4343737) (← links)
- Method of approximate centers for semi-definite programming (Q4345241) (← links)
- (Q4347841) (← links)
- (Q4347843) (← links)
- (Q4355914) (← links)
- (Q4362984) (← links)
- Computing Maximum Likelihood Estimators of Convex Density Functions (Q4389265) (← links)
- Copositive realxation for genera quadratic programming (Q4391294) (← links)
- (Q4395415) (← links)
- (Q4398364) (← links)
- (Q4400648) (← links)
- A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
