Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
From MaRDI portal
Publication:4210329
DOI10.1137/S1052623494265359zbMath0915.65059OpenAlexW1965565518MaRDI QIDQ4210329
Publication date: 21 September 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494265359
convergencenonsmooth optimizationNewton's methodnumerical examplespenalty methodnetwork quadratic programmingpiecewise quadrature programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Deterministic network models in operations research (90B10)
Related Items
On piecewise quadratic Newton and trust region problems ⋮ Quadratic cost flow and the conjugate gradient method ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems