The following pages link to (Q4016509):
Displayed 31 items.
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- Long-step primal path-following algorithm for monotone variational inequality problems (Q1275718) (← links)
- A continuation method for (strongly) monotone variational inequalities (Q1290602) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A note on exploiting structure when using slack variables (Q1340068) (← links)
- Some properties of the Hessian of the logarithmic barrier function (Q1341572) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Modified primal path-following scheme for the monotone variational inequality problem (Q1372549) (← links)
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices (Q1379115) (← links)
- Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics (Q1574221) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Higher-order derivatives in linear and quadratic programming (Q1592581) (← links)
- Interior-point methods (Q1593831) (← links)
- The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
- Two numerical methods for optimizing matrix stability (Q1611899) (← links)
- An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
- Inertia-controlling factorizations for optimization algorithms (Q1862009) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- A method of Euclidean centers (Q1906945) (← links)
- Global optimization for the biaffine matrix inequality problem (Q1913606) (← links)
- Primal-dual methods for linear programming (Q1924065) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- On the Newton interior-point method for nonlinear programming problems (Q1973482) (← links)
- Inexact-restoration algorithm for constrained optimization (Q1973486) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Bifurcation instability in linear elasticity with the constraint of local injectivity (Q2465434) (← links)
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
- Equivalent formulae for the supremum and stability of weighted pseudoinverses (Q4372655) (← links)
- The interior-point revolution in optimization: History, recent developments, and lasting consequences (Q4829921) (← links)
- Convergence of iterative methods for stabilized saddle-point problems (Q5462891) (← links)
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds (Q5691011) (← links)