Locating, characterizing and computing the stationary points of a function

DOI10.1007/BF02425923zbMath0853.65065OpenAlexW58217623MaRDI QIDQ1916996

Michael N. Vrahatis, Evangelia C. Triantafyllou

Publication date: 14 July 1996

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02425923

zbMATH Keywords

nonlinear programmingsaddle pointmaximumminimumstationary pointscombinatorial topologydegree of a mappingoriented polyhedron

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Degree, winding number (55M25)

Uses Software

• CHABIS

Cites Work

• Unnamed Item
• Unnamed Item
• A rapid generalized method of bisection for solving systems of non-linear equations
• An efficient method for locating and computing periodic orbits of nonlinear mappings
• A new unconstrained optimization method for imprecise function and gradient values
• A dimension-reducing method for unconstrained optimization
• Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
• A note on solution of nonlinear programming problems with imprecise function and gradient values
• Solving systems of nonlinear equations using the nonzero value of the topological degree
• Locating and Computing All the Simple Roots and Extrema of a Function

This page was built for publication: Locating, characterizing and computing the stationary points of a function