A lagrangean relaxation algorithm for the constrained matrix problem

DOI10.1002/NAV.3800330106MaRDI QIDQ3734170zbMATH OpenOpenAlexFDO

Authors Steven G. Duvall, Karel Zikan, R. 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

zbMATH Keywords

transportation polytopeLagrangean relaxation algorithmstrictly convex separable quadratic function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical methods of relaxation type (49M20)

Recommendations

• On Lagrangian relaxation of quadratic matrix constraints
• A Lagrangean relaxation method for the constrained assignment problem
• A relaxed alternating projection method for solving a linear matrix equation problem under closed convex constraints
• Constrained matrix optimization with applications
• A new algorithm for constrained matrix least squares approximations
• On Lagrangian relaxation for constrained maximization and reoptimization problems
• A matrix LSQR algorithm for solving constrained linear operator equations
• scientific article; zbMATH DE number 3858858
• Partially Augmented Lagrangian Method for Matrix Inequality Constraints

Cites work

• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 3311499 (Why is no real title available?)
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems

Cited in

(28)

• Asymmetric variational inequality problems over product sets: Applications and iterative methods
• Variable fixing method by weighted average for the continuous quadratic knapsack problem
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• scientific article; zbMATH DE number 5173819 (Why is no real title available?)
• Constraint programming based Lagrangian relaxation for the automatic recording problem
• A Lagrangean relaxation method for the constrained assignment problem
• Algorithms for quadratic constrained matrix problems
• Approximation algorithms for indefinite quadratic programming
• Numerical structure of the Hessian of the Lagrange dual function for a class of convex problems
• Interval-constrained matrix balancing
• scientific article; zbMATH DE number 4104746 (Why is no real title available?)
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• On the linear convergence of the alternating direction method of multipliers
• Solution of projection problems over polytopes
• Variable fixing algorithms for the continuous quadratic Knapsack problem
• On the solution of concave knapsack problems
• Application of the dual active set algorithm to quadratic network optimization
• Local minima for indefinite quadratic knapsack problems
• Inexact Newton methods for the nonlinear complementarity problem
• A generalized multi-parameterized proximal point algorithm for linearly constrained convex optimization problem
• On the continuous quadratic knapsack problem
• A survey on the continuous nonlinear resource allocation problem
• Easy transportation-like problems on K-dimensional arrays
• scientific article; zbMATH DE number 3852799 (Why is no real title available?)
• A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• Dykstra's Algorithm for a Constrained Least-squares Matrix Problem

This page was built for publication: A lagrangean relaxation algorithm for the constrained matrix problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734170)