A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS
From MaRDI portal
Recommendations
- THE PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS ON POLYHEDRAL CONES
- A Simplicial Algorithm for Stationary Point Problems on Polytopes
- Linear Stationary Point Problems on Unbounded Polyhedra
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
- scientific article; zbMATH DE number 4119955
Cited in
(14)- A differentiable path-following algorithm for computing perfect stationary points
- An iterative algorithm to determine the number of time steps in path generation methods
- Endpoints of multivalued nonexpansive mappings in geodesic spaces
- Linear Stationary Point Problems on Unbounded Polyhedra
- Basic ANM algorithms for path following problems
- THE PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS ON POLYHEDRAL CONES
- A Simplicial Algorithm for Stationary Point Problems on Polytopes
- A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
- scientific article; zbMATH DE number 4119955 (Why is no real title available?)
- scientific article; zbMATH DE number 1418042 (Why is no real title available?)
- Common endpoints for Suzuki mappings in uniformly convex hyperbolic spaces
- A path-following procedure to find a proper equilibrium of finite games
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
This page was built for publication: A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726069)