Interior point methods of mathematical programming
From MaRDI portal
Publication:1353361
zbMath0866.00024MaRDI QIDQ1353361
No author found.
Publication date: 29 April 1997
Published in: Applied Optimization (Search for Journal in Brave)
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx)
Related Items
A full-step interior-point algorithm for linear complementarity problem based on a simple function, On the complexity of a combined homotopy interior method for convex programming, Criss-cross methods: A fresh view on pivot algorithms, How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results, Refinement of Lagrangian bounds in optimization problems, The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints, Interior Point Methods for Nonlinear Optimization, An easy way to teach interior-point methods., An interior point algorithm for global optimal solutions and KKT points, Computing maximum likelihood estimators of a log-concave density function, Examples of ill-behaved central paths in convex optimization, The complexity of self-regular proximity based infeasible IPMs, A numerical method for solving linear non-autonomous systems based on linear programming, Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment, A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity, Monotone variable-metric algorithm for linearly constrained nonlinear programming, A primal-dual decomposition algorithm for multistage stochastic convex programming, A primal-proximal heuristic applied to the French unit-commitment problem, Symbiosis between linear algebra and optimization, An interior point method for solving systems of linear equations and inequalities
