Partial linearization methods in nonlinear programming

DOI10.1007/BF00939668zbMath0796.90058OpenAlexW2085315287MaRDI QIDQ1321373

Michael Patriksson

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939668

zbMATH Keywords

global convergencepartial linearizationnondifferentiable programmingfeasible direction methodsapproximate line searches

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items

Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem ⋮ A class of gap functions for variational inequalities ⋮ A heuristic for the OD matrix adjustment problem in a congested transport network ⋮ Approximation of the steepest descent direction for the O-D matrix adjustment problem ⋮ New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks ⋮ Merit functions and descent algorithms for a class of variational ineqality problems ⋮ Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. ⋮ Large scale stochastic inventory routing problems with~split delivery and service level constraints ⋮ Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs ⋮ A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ Improving truncated Newton method for the logit-based stochastic user equilibrium problem ⋮ Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods ⋮ Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems ⋮ A unified description of iterative algorithms for traffic equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cross decomposition applied to the stochastic transportation problem
• A method for minimizing the sum of a convex function and a continuously differentiable function
• A minimization method for the sum of a convex function and a continuously differentiable function
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• A unified description of iterative algorithms for traffic equilibria
• Minimization of functions having Lipschitz continuous first partial derivatives
• An algorithm for nonlinear programs over Cartesian product sets
• A partial linearization method for the traffic assignment problem
• A generalized proximal point algorithm for certain non-convex minimization problems
• Generalized Gradients and Applications
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
• Convex Analysis