Application of the dual active set algorithm to quadratic network optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 4002053 (Why is no real title available?)
- scientific article; zbMATH DE number 3664705 (Why is no real title available?)
- scientific article; zbMATH DE number 3692120 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 724210 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- A Generalization of the Proximal Point Algorithm
- A Newton method for convex separable network flow problems
- A Reduced Gradient Algorithm for Nonlinear Network Problems
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- A lagrangean relaxation algorithm for the constrained matrix problem
- A numerically stable dual method for solving strictly convex quadratic programs
- A polynomial algorithm for minimum quadratic cost flow problems
- A polynomially bounded algorithm for a singly constrained quadratic program
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- A quadratic network optimization model for equilibrium single commodity trade flows
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- A transformation for necessary optimality conditions for systems with polynomial nonlinearities
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex Analysis
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Dual Approximations in Optimal Control
- Dual techniques for constrained optimization
- Generalized Gradients and Applications
- Implementing an “exact” Newton method for separable convex transportation problems
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- Minimum norm problems over transportation polytopes
- Monotone Operators and the Proximal Point Algorithm
- Multipoint methods for separable nonlinear networks
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On large scale nonlinear network optimization
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Restricted simplicial decomposition: Computation and extensions
- Simplicial Decomposition for Convex Generalized Networks
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Submonotone mappings and the proximal point algorithm
- The conjugate gradient technique for certain quadratic network problems
- Updating the Inverse of a Matrix
Cited in
(14)- scientific article; zbMATH DE number 724210 (Why is no real title available?)
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- The dual active set algorithm and its application to linear programming
- Projection onto a polyhedron that exploits sparsity
- Nonlinear conjugate gradient methods for the optimal control of laser surface hardening
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- Dual active sets and constrained optimization
- 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
- Error estimation in nonlinear optimization
- A sparse proximal implementation of the LP dual active set algorithm
- Dual multilevel optimization
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
This page was built for publication: Application of the dual active set algorithm to quadratic network optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366828)
