A simple bilinear optimization problem
type: Item
instance of: scholarly article
title: A simple bilinear optimization problem
zbMATH Open document ID: 0632.90068
DOI: 10.1016/0167-6911(86)90022-8
author: H. S. Witsenhausen
published in: Systems \& Control Letters
publication date: 1986-01-01T00:00:00Z
review text: The author investigates the bilinear optimization problem of maximizing the scalar product of two vectors, each constrained to a given closed ball. A qualitative analysis of this special problem is given in the Euclidean plane.
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 4029281
zbMATH Keywords: maximum inner product
zbMATH Keywords: two-sphere problem
zbMATH Keywords: bilinear optimization
reviewed by: Johannes Jahn
MaRDI profile type: Publication
full work available at URL: 0167-6911(86)90022-8
OpenAlex ID: W2078475415
cites work: Q4198056
cites work: Q3873927
Recommended article: A simple algorithm for the-linear bilevel programming problem
Recommended article: A method of solving bilinear minimax problems
Recommended article: A linear programming approach to solving bilinear programmes
Recommended article: Q4300099
Recommended article: An Optimization Problem with a Surprisingly Simple Solution
Recommended article: Optimality Conditions for a Simple Convex Bilevel Programming Problem
Recommended article: Q5287089
Recommended article: The Linear-Quadratic Bilevel Programming Problem
Recommended article: Q5742015
Recommended article: Q3561349
description: scientific article; zbMATH DE number 4029281