A note on reduction of quadratic and bilinear programs with equality constraints
From MaRDI portal
Publication:598586
DOI10.1023/A:1013838625301zbMATH Open1045.90043OpenAlexW1505732277MaRDI QIDQ598586FDOQ598586
Authors: Jack Brimberg, Pierre Hansen, Nenad Mladenović 
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013838625301
Recommendations
- A note on the solution of bilinear programming problems by reduction to concave minimization
- Reduction of indefinite quadratic programs to bilinear programs
- On a class of quadratic programming problem with equality constraints
- A reduced successive quadratic programming algorithm for nonlinearly equality constrained optimization
- On the solution of equality constrained quadratic programming problems arising in optimization
- On a quadratic optimization problem with equality constraints
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- A note on a quadratic formulation for linear complementarity problems
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- scientific article; zbMATH DE number 57066
Cited In (5)
- Linearity embedded in nonconvex programs
- Reduction of indefinite quadratic programs to bilinear programs
- Convexification of bilinear forms through non-symmetric lifting
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra
This page was built for publication: A note on reduction of quadratic and bilinear programs with equality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598586)
