Massively Parallel Algorithms for Singly Constrained Convex Programs

DOI10.1287/ijoc.4.2.166zbMath0771.90079OpenAlexW2024574812MaRDI QIDQ4030788

Søren S. Nielsen, Stavros A. Zenios

Publication date: 1 April 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.4.2.166

zbMATH Keywords

SIMDmassively parallel computersseparable, convex nonlinear optimizationvery large problems

Mathematics Subject Classification ID

Convex programming (90C25) Parallel numerical computation (65Y05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (26)

Data parallel computing for network-structured optimization problems ⋮ Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs ⋮ Decision model and analysis for investment interest expense deduction and allocation ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ A parallel descent algorithm for convex programming ⋮ Asynchronous gradient algorithms for a class of convex separable network flow problems ⋮ Quadratic resource allocation with generalized upper bounds ⋮ Fast algorithm for the quadratic knapsack problem ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ Interval underrelaxed bregman's method with an application ⋮ Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints ⋮ Issues in the implementation of the DSD algorithm for the traffic assignment problem ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Breakpoint searching algorithms for the continuous quadratic knapsack problem ⋮ A convergent decomposition algorithm for support vector machines ⋮ A relaxed projection method for general integer quadratic knapsack problem. ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ Solving the continuous nonlinear resource allocation problem with an interior point method ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals ⋮ A model for portfolio management with mortgage-backed securities ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem ⋮ Nonlinear integer programming for optimal allocation in stratified sampling

This page was built for publication: Massively Parallel Algorithms for Singly Constrained Convex Programs