Publication:3744775
From MaRDI portal
zbMath0606.49008MaRDI QIDQ3744775
Publication date: 1986
90C25: Convex programming
65K10: Numerical optimization and variational techniques
49M15: Newton-type methods
49J52: Nonsmooth analysis
90C55: Methods of successive quadratic programming type
90C99: Mathematical programming
Related Items
Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, A modified subgradient algorithm for Lagrangean relaxation, Supply chain design under uncertainty using sample average approximation and dual decomposition, A constraint linearization method for nondifferentiable convex minimization, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Solving nonsmooth inclusions in the convex case