A dual method for polar cuts in disjoint bilinear programming
From MaRDI portal
Publication:6546113
Cites work
- A cutting plane algorithm for solving bilinear programs
- A cutting plane algorithm for the bilinear programming problem
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A new full-NT step interior-point method for circular cone optimization
- A new search direction for full-Newton step infeasible interior-point method in linear optimization
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
- A simple finite cone covering algorithm for concave minimization
- Bi-level optimization based on fuzzy if-then rule
- Bilinear programming: An exact algorithm
- Cutting Planes for Low-Rank-Like Concave Minimization Problems
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Finitely convergent cutting planes for concave minimization
- Generation of disjointly constrained bilinear programming test problems
- How to extend the concept of convexity cuts to derive deeper cutting planes
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- On the hierarchy of γ-valid cuts in global optimization
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- The bilinear programming problem
This page was built for publication: A dual method for polar cuts in disjoint bilinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546113)
