Massively Parallel Algorithms for Singly Constrained Convex Programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1552018
- scientific article; zbMATH DE number 515934
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- On the Fine-Grain Decomposition of Multicommodity Transportation Problems
- Proximal minimizations with D-functions and the massively parallel solution of linear network programs
Cited in
(38)- A distributed algorithm for convex network optimization problems
- Parallel optimization for traffic assignment
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
- A model for portfolio management with mortgage-backed securities
- Massively parallel implementation of the splitting equilibration algorithm
- Parallel alternating direction multiplier decomposition of convex programs
- Data parallel computing for network-structured optimization problems
- Quadratic resource allocation with generalized upper bounds
- The nonlinear knapsack problem - algorithms and applications
- Nonlinear integer programming for optimal allocation in stratified sampling
- Solving the continuous nonlinear resource allocation problem with an interior point method
- A parallel descent algorithm for convex programming
- Asynchronous gradient algorithms for a class of convex separable network flow problems
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- 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
- Issues in the implementation of the DSD algorithm for the traffic assignment 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.
- Fast algorithm for the quadratic knapsack problem
- Large-scale convex optimization via saddle point computation
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A Parallel Algorithm for a Class of Convex Programs
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- Parallel Constraint Distribution
- Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor<scp>n</scp>CUBE
- scientific article; zbMATH DE number 1046042 (Why is no real title available?)
- scientific article; zbMATH DE number 1530366 (Why is no real title available?)
- scientific article; zbMATH DE number 1552018 (Why is no real title available?)
- Interval underrelaxed bregman's method with an application
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- A pegging algorithm for the nonlinear resource allocation problem
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- A breakpoint search approach for convex resource allocation problems with bounded variables
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
This page was built for publication: Massively Parallel Algorithms for Singly Constrained Convex Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030788)
