Application of the dual active set algorithm to quadratic network optimization
From MaRDI portal
Publication:2366828
DOI10.1007/BF00248762zbMath0791.90053MaRDI QIDQ2366828
William W. Hager, Donald W. Hearn
Publication date: 23 August 1993
Published in: Computational Optimization and Applications (Search for Journal in Brave)
equality constraintsconvex quadratic programmingconjugate gradientdual active set algorithmproximal point methodcoordinate ascentlarge-scale quadratic network
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Nonlinear conjugate gradient methods for the optimal control of laser surface hardening, Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices, A survey on the continuous nonlinear resource allocation problem, A sparse proximal implementation of the LP dual active set algorithm, Dual multilevel optimization, Error estimation in nonlinear optimization, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, Projection onto a Polyhedron that Exploits Sparsity, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- A polynomial algorithm for minimum quadratic cost flow problems
- On large scale nonlinear network optimization
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Dual techniques for constrained optimization
- Minimum norm problems over transportation polytopes
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- A transformation for necessary optimality conditions for systems with polynomial nonlinearities
- Multipoint methods for separable nonlinear networks
- Dual Approximations in Optimal Control
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- A Generalization of the Proximal Point Algorithm
- A Newton method for convex separable network flow problems
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- A lagrangean relaxation algorithm for the constrained matrix problem
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- Restricted simplicial decomposition: Computation and extensions
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Updating the Inverse of a Matrix
- Implementing an “exact” Newton method for separable convex transportation problems
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- Submonotone mappings and the proximal point algorithm
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Generalized Gradients and Applications
- Monotone Operators and the Proximal Point Algorithm
- The conjugate gradient technique for certain quadratic network problems
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- A quadratic network optimization model for equilibrium single commodity trade flows
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Simplicial Decomposition for Convex Generalized Networks
- A Reduced Gradient Algorithm for Nonlinear Network Problems
- Convex Analysis
