Dual multilevel optimization

DOI10.1007/S10107-006-0022-3MaRDI QIDQ2465655zbMATH OpenOpenAlexFDO

Authors Timothy A. Davis, William Hager

Publication date 7 January 2008

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-006-0022-3

zbMATH Keywords

Dual active set algorithmDual optimizationDual separabilityMultilevel optimizationParallel algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• An Implementation Of The Dual Local Decomposition Method
• scientific article; zbMATH DE number 1086901
• Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor<scp>n</scp>CUBE
• Local statements on dual methods in problems of multilevel optimization
• Dual algorithms for solving convex partially separable optimization problems

Cites work

• A Cartesian Parallel Nested Dissection Algorithm
• A column approximate minimum degree ordering algorithm
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A generalized envelope method for sparse factorization by rows
• A Mathematical Theory of Communication
• A set of level 3 basic linear algebra subprograms
• A sparse proximal implementation of the LP dual active set algorithm
• Algorithm 849
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Application of the dual active set algorithm to quadratic network optimization
• Commentary—Progress in Linear Programming
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 3958638 (Why is no real title available?)
• scientific article; zbMATH DE number 1424215 (Why is no real title available?)
• Hyper-sparsity in the revised simplex method and how to exploit it
• Improving the Run Time and Quality of Nested Dissection Ordering
• Modifying a Sparse Cholesky Factorization
• Multiple-rank modifications of a sparse Cholesky factorization
• Nested-dissection orderings for sparse LU with partial pivoting
• Parallel interior-point solver for structured linear programs
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Partitioning mathematical programs for parallel solution
• Presolving in linear programming
• Row Modifications of a Sparse Cholesky Factorization
• The dual active set algorithm and its application to linear programming

Cited in

(6)

• Solving dual problems using a coevolutionary optimization algorithm
• A sparse proximal implementation of the LP dual active set algorithm
• Projection onto a polyhedron that exploits sparsity
• Local statements on dual methods in problems of multilevel optimization
• How good are extrapolated bi-projection methods for linear feasibility problems?
• Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm

Describes a project that uses

Uses Software

• CHOLMOD
• CPLEX
• BLAS
• NETLIB LP Test Set
• COLAMD
• LDL
• OOPS

This page was built for publication: Dual multilevel optimization

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