Optimization of functions with rank-two variation over a box

DOI10.1016/J.EJOR.2003.01.001zbMATH Open1120.90057OpenAlexW2024350364MaRDI QIDQ706945FDOQ706945

Authors Immanuel M. Bomze

Publication date 9 February 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2003.01.001

zbMATH Keywords

Nonlinear programmingLarge scale optimizationLinear-time algorithmTelecommunication

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Fractional programming (90C32) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Global optimization of a rank-two nonconvex program
• Underestimation functions for a rank-two partitioning method
• Algorithms – ESA 2005
• A variational approach of the rank function
• Optimizing of sums and products of linear fractional functions under linear constraints

Cites work

• scientific article; zbMATH DE number 3557508 (Why is no real title available?)
• scientific article; zbMATH DE number 757682 (Why is no real title available?)
• A Parametric Method for Solving the Linear Fractional Programming Problem
• A complete algorithm for linear fractional programs
• A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
• Equivalence of various linearization algorithms for linear fractional programming
• On Martos' and Chaehes-Coopeb's approach vis-a-vis
• Programming with linear fractional functionals
• Quadratic programming with one negative eigenvalue is NP-hard

This page was built for publication: Optimization of functions with rank-two variation over a box

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