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

DOI10.15807/JORSJ.39.63MaRDI QIDQ4889751zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3892947
• An efficient solution method for rank two quasiconcave minimization problems
• scientific article; zbMATH DE number 4010217
• scientific article; zbMATH DE number 1988044
• A Descent Algorithm for Minimizing Polyhedral Convex Functions

Cited in

(7)

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

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)