THE PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS ON POLYHEDRAL CONES

DOI10.15807/JORSJ.32.286MaRDI QIDQ3479828zbMATH OpenOpenAlexFDO

Authors Yang Dai, Yoshitsugu Yamamoto

Publication date 1989

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.32.286

zbMATH Keywords

copositive plus matrixpath following algorithmsimplicial algorithmstationary point

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS
• A Simplicial Algorithm for Stationary Point Problems on Polytopes
• A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
• Linear Stationary Point Problems on Unbounded Polyhedra
• A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex

Cited in

(7)

• A differentiable path-following algorithm for computing perfect stationary points
• Linear Stationary Point Problems on Unbounded Polyhedra
• scientific article; zbMATH DE number 4144791 (Why is no real title available?)
• 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
• A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS

This page was built for publication: THE PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS ON POLYHEDRAL CONES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479828)