A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods

DOI10.1007/BF01581701zbMath0834.90124MaRDI QIDQ1338143

Athanasios Migdalas

Publication date: 1 April 1996

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

zbMATH Keywords

decompositiongap functionFrank-Wolfe algorithmfeasible direction algorithmpseudoconvex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Bilevel programming in traffic planning: Models, methods and challenge ⋮ A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints ⋮ A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization ⋮ A comparison of feasible direction methods for the stochastic transportation problem ⋮ Complexity bounds for primal-dual methods minimizing the model of objective function ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ A general descent framework for the monotone variational inequality problem ⋮ A unified description of iterative algorithms for traffic equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The gap function of a convex program
• An algorithm for nonlinear programs over Cartesian product sets
• Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
• Convex quadratic programming with one constraint and bounded variables
• A partial linearization method for the traffic assignment problem
• Optimal Routing in a Packet-Switched Computer Network
• A Primal-Dual Traffic Assignment Algorithm
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• On the Goldstein-Levitin-Polyak gradient projection method
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• An extension of the frank and Wolfe method of feasible directions
• The flow deviation method: An approach to store‐and‐forward communication network design
• Traffic assignment problem for a general network