Publication:4016509
From MaRDI portal
zbMath0766.65053MaRDI QIDQ4016509
Publication date: 16 January 1993
complexity; linear optimization; barrier methods; interior methods; convex and nonconvex optimization
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C30: Nonlinear programming
Related Items
Equivalent formulae for the supremum and stability of weighted pseudoinverses, The interior-point revolution in optimization: History, recent developments, and lasting consequences, Convergence of iterative methods for stabilized saddle-point problems, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, Method of centers for minimizing generalized eigenvalues, Long-step primal path-following algorithm for monotone variational inequality problems, A continuation method for (strongly) monotone variational inequalities, Degeneracy in interior point methods for linear programming: A survey, A note on exploiting structure when using slack variables, Some properties of the Hessian of the logarithmic barrier function, A primal-dual interior point method whose running time depends only on the constraint matrix, Modified primal path-following scheme for the monotone variational inequality problem, Componentwise analysis of direct factorization of real symmetric and Hermitian matrices, Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics, Symbiosis between linear algebra and optimization, Higher-order derivatives in linear and quadratic programming, Interior-point methods, 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, Two numerical methods for optimizing matrix stability, An interior-point method for fractional programs with convex constraints, Inertia-controlling factorizations for optimization algorithms, The convergence of an interior-point method using modified search directions in final iterations, A method of Euclidean centers, Global optimization for the biaffine matrix inequality problem, Primal-dual methods for linear programming, Linear programming, complexity theory and elementary functional analysis, On the Newton interior-point method for nonlinear programming problems, Inexact-restoration algorithm for constrained optimization, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Bifurcation instability in linear elasticity with the constraint of local injectivity, A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
