Improved smoothing-type methods for the solution of linear programs
From MaRDI portal
Publication:1348921
DOI10.1007/s002110100301zbMath0994.65065OpenAlexW1970394240MaRDI QIDQ1348921
Stephan Engelke, Christian Kanzow
Publication date: 21 May 2002
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110100301
Related Items (19)
A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming ⋮ Convergence of a non-interior continuation algorithm for the monotone SCCP ⋮ A complementarity model and algorithm for multi-commodity flow supply chain network equilibrium with random demands ⋮ Solvability of Newton equations in smoothing-type algorithms for the SOCCP ⋮ A non-interior continuation algorithm for the CP based on a generalized smoothing function ⋮ Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems ⋮ A smoothing-type algorithm for solving system of inequalities ⋮ Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints ⋮ Analysis of a non-interior continuation method for second-order cone programming ⋮ A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties ⋮ A non-interior-point smoothing method for variational inequality problem ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Predictor-corrector smoothing methods for monotone LCP ⋮ Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem ⋮ Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
Uses Software
This page was built for publication: Improved smoothing-type methods for the solution of linear programs
