Underestimation functions for a rank-two partitioning method
From MaRDI portal
Publication:2026521
DOI10.1007/s10203-020-00288-6zbMath1468.90126OpenAlexW3034884403MaRDI QIDQ2026521
Publication date: 19 May 2021
Published in: Decisions in Economics and Finance (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10203-020-00288-6
global optimizationnonlinear programmingoptimal level solutionslarge dimension problemslow-rank structures
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (3)
Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measuring the efficiency of decision making units
- Generalized convexity and optimization. Theory and applications
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Handbook of global optimization
- Optimization on low rank nonconvex structures
- Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
- Discrete and fractional programming techniques for location models
- Global optimization of multiplicative programs
- Linear-fractional programming. Theory, methods, applications and software.
- A finite algorithm for a class of nonlinear multiplicative programs
- A finite algorithm for a particular D.C. quadratic programming problem
- Handbook on data envelopment analysis
- Global optimization of a rank-two nonconvex program
- A sequential method for a class of box constrained quadratic programming problems
- On the minimization of a class of generalized linear functions on a flow polytope
- A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE
- A new solution method for a class of large dimension rank-two nonconvex programs
- Fractional Programming
- Convex analysis and global optimization
This page was built for publication: Underestimation functions for a rank-two partitioning method