scientific article
From MaRDI portal
Publication:3348711
zbMath0726.90067MaRDI QIDQ3348711
Yinyu Ye, Chi-Geun Han, Panos M. Pardalos
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
box constraintsinterior point methodvectorizationlarge-scale sparse problemsprimal-dual potential reduction algorithm
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Related Items
A convergent decomposition method for box-constrained optimization problems, Stopping criteria for inner iterations in inexact potential reduction methods: a computational study, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints, Merging of Bézier curves with box constraints, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, A new trust-region method for solving systems of equalities and inequalities, Near boundary behavior of primal-dual potential reduction algorithms for linear programming
