scientific article; zbMATH DE number 823376
From MaRDI portal
Publication:4856863
zbMATH Open0837.90082MaRDI QIDQ4856863FDOQ4856863
Authors: Roberto Cominetti
Publication date: 5 December 1995
Full work available at URL: https://eudml.org/doc/225563
Title of this publication is not available (Why is that?)
Recommendations
- A convergence result for nonautonomous subgradient evolution equations and its application to the steepest descent exponential penalty trajectory in linear programming
- Steepest descent evolution equations: asymptotic behavior of solutions and rate of convergence
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Asymptotic expansion of penalty-gradient flows in linear programming
- scientific article; zbMATH DE number 967075
exponential penalty functionasymptotic convergenceexistence of global solutionsnon-autonomous nonlinear evolution equation
Convex programming (90C25) Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31)
Cited In (7)
- Steepest descent evolution equations: asymptotic behavior of solutions and rate of convergence
- Asymptotic expansion of penalty-gradient flows in linear programming
- Coupling the proximal point algorithm with approximation methods
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- A convergence result for nonautonomous subgradient evolution equations and its application to the steepest descent exponential penalty trajectory in linear programming
- An entire space polynomial-time algorithm for linear programming
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4856863)