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

DOI10.15807/JORSJ.39.63zbMATH Open0851.90117OpenAlexW1536316748MaRDI QIDQ4889751FDOQ4889751

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)

Cited In (7)

• Global optimization of a rank-two nonconvex program
• Rank-two programs involving linear fractional functions
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Underestimation functions for a rank-two partitioning method
• Multiplicative programming problems: Analysis and efficient point search heuristic
• A method based on parametric convex programming for solving convex multiplicative programming problem
• Level set algorithm for solving convex multiplicative programming problems

   Recommendations

• Title not available (Why is that?) 👍 👎
• An efficient solution method for rank two quasiconcave minimization problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A Descent Algorithm for Minimizing Polyhedral Convex Functions 👍 👎

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

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