An algorithm for nonlinear programs over Cartesian product sets

DOI10.1080/02331939008843577zbMath0726.90069OpenAlexW2024970792MaRDI QIDQ3348713

Torbjörn Larsson, Athanasios Migdalas

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939008843577

zbMATH Keywords

convergencecomputer communication networkstransportation planningfeasible direction algorithmseparable constraintsnon-separable objective

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods ⋮ Efficient decomposition and linearization methods for the stochastic transportation problem ⋮ Coupling the auxiliary problem principle with descent methods of pseudoconvex programming ⋮ A partial linearization method for the traffic assignment problem ⋮ Eigendecomposition of the Mean-Variance Portfolio Optimization Model ⋮ Partial linearization methods in nonlinear programming ⋮ A unified description of iterative algorithms for traffic equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed algorithm for convex network optimization problems
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Optimal Routing in a Packet-Switched Computer Network
• A Primal-Dual Traffic Assignment Algorithm
• Large-scale linearly constrained optimization
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• The Convex Simplex Method
• Accelerated Frank–Wolfe Algorithms

This page was built for publication: An algorithm for nonlinear programs over Cartesian product sets