scientific article

zbMath0297.65041MaRDI QIDQ4051509

Claude Lemaréchal

Publication date: 1974

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (17)

A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ A bundle modification strategy for convex minimization ⋮ Algorithms for a class of nondifferentiable problems ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ Unnamed Item ⋮ Regularized stochastic dual dynamic programming for convex nonlinear optimization problems ⋮ A method for minimizing convex functions based on continuous approximations to the subdifferential ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Proximal bundle methods for nonsmooth DC programming ⋮ The omnipresence of Lagrange ⋮ Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley ⋮ Essentials of numerical nonsmooth optimization ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ A proximal trust-region algorithm for column generation stabilization ⋮ Essentials of numerical nonsmooth optimization

This page was built for publication: