A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE

DOI10.15807/jorsj.39.63zbMath0851.90117OpenAlexW1536316748MaRDI QIDQ4889751

Takahito Kuno

Publication date: 6 August 1996

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.39.63

zbMATH Keywords

saddle functionsglobally \(\varepsilon\)-optimal solutionparametric right-hand-side simplex algorithmsuccessive underestimation

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (5)

Global optimization of a rank-two nonconvex program ⋮ Multiplicative programming problems: Analysis and efficient point search heuristic ⋮ Underestimation functions for a rank-two partitioning method ⋮ Outcome-space cutting-plane algorithm for linear multiplicative programming ⋮ Level set algorithm for solving convex multiplicative programming problems

This page was built for publication: A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE