On the continuous-time complementarity problem
From MaRDI portal
Cites work
- A class of continuous nonlinear complementarity problems
- A simplex based algorithm to solve separated continuous linear programs
- A special newton-type optimization method
- An Algorithm for a Class of Continuous Linear Programs
- Approximate solutions and error bounds for a class of continuous-time linear programming problems
- Bimatrix Equilibrium Points and Mathematical Programming
- Convex Analysis
- Discrete approximations for strict convex continuous time problems and duality
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
- Generalized vector variational inequality and its duality for set-valued maps
- Necessary conditions for continuous-time optimization under the Mangasarian-Fromovitz constraint qualification
- Nonlinear Programs with Positively Bounded Jacobians
- On the continuous-time complementarity problem
- Self-Dual Quadratic Programs
- Solving continuous-time linear programming problems based on the piecewise continuous functions
- Strong vector variational inequalities in Banach spaces
- The nonlinear complementarity problem, with applications. I
- The unloading problem for plane curves.
- Theorems of the alternative for systems of convex inequalities
- Vector variational inequality and its duality
This page was built for publication: On the continuous-time complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6958367)