A lagrangean relaxation algorithm for the constrained matrix problem
From MaRDI portal
Publication:3734170
DOI10.1002/nav.3800330106zbMath0598.90070OpenAlexW2117379131MaRDI QIDQ3734170
Karel Zikan, Steven G. Duvall, Richard W. Cottle
Publication date: 1986
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800330106
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical methods of relaxation type (49M20)
Related Items
Asymmetric variational inequality problems over product sets: Applications and iterative methods, Application of the dual active set algorithm to quadratic network optimization, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization, Numerical Structure of the Hessian of the Lagrange Dual Function for a Class of Convex Problems, Variable fixing algorithms for the continuous quadratic Knapsack problem, A survey on the continuous nonlinear resource allocation problem, Solution of projection problems over polytopes, Local minima for indefinite quadratic knapsack problems, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, On the continuous quadratic knapsack problem, On the linear convergence of the alternating direction method of multipliers, Approximation algorithms for indefinite quadratic programming, Algorithms for quadratic constrained matrix problems, On the solution of concave knapsack problems, Interval-constrained matrix balancing, Inexact Newton methods for the nonlinear complementarity problem, Easy transportation-like problems on K-dimensional arrays, Variable fixing method by weighted average for the continuous quadratic knapsack problem
Cites Work
