On the public citation graph

A cone programming approach to the bilinear matrix inequality problem and its geometry

https://doi.org/10.1007/bf02614437
0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-74759-0_333openalex-snapshot
Linear Complementarity Problem
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-642-80730-5openalex-snapshot
Cones, Matrices and Mathematical Programming
inferredcites →https://doi.org/10.1007/bf01585749openalex-snapshot
Generalized linear complementarity problems
inferredcites →https://doi.org/10.1007/bf02592948openalex-snapshot
Some NP-complete problems in quadratic and nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0084653openalex-snapshot
Complementarity Problems
inferredcites →https://doi.org/10.1007/springerreference_5340openalex-snapshot
Complementarity problems
inferredcites →https://doi.org/10.1017/cbo9780511810817openalex-snapshot
Matrix Analysis
inferredcites →https://doi.org/10.1017/cbo9780511840371openalex-snapshot
Topics in Matrix Analysis
inferredcites →https://doi.org/10.1109/9.554402openalex-snapshot
On the rank minimization problem over a positive semidefinite linear matrix inequality
inferredcites →https://doi.org/10.1109/acc.1994.751690openalex-snapshot
Control system synthesis via bilinear matrix inequalities
inferredcites →https://doi.org/10.1109/acc.1995.532300openalex-snapshot
On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback
inferredcites →https://doi.org/10.1109/cdc.1994.411445openalex-snapshot
A global optimization approach for the BMI problem
inferredcites →https://doi.org/10.1137/0327044openalex-snapshot
Complementarity Problems over Locally Compact Cones
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/1.9780898719000openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9781611970777openalex-snapshot
Linear Matrix Inequalities in System and Control Theory
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_28openalex-snapshot
Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-06569-4_3openalex-snapshot
DC Programming Approaches for BMI and QMI Feasibility Problems
inferred← citeshttps://doi.org/10.1007/pl00011387openalex-snapshot
On semidefinite linear complementarity problems
inferred← citeshttps://doi.org/10.1007/pl00011394openalex-snapshot
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
inferred← citeshttps://doi.org/10.1016/j.laa.2014.03.028openalex-snapshot
Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone
inferred← citeshttps://doi.org/10.1016/s0024-3795(03)00425-7openalex-snapshot
On some interconnections between strict monotonicity, globally uniquely solvable, and P properties in semidefinite linear complementarity problems
inferred← citeshttps://doi.org/10.1023/a:1011224403708openalex-snapshot
Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem
inferred← citeshttps://doi.org/10.1109/9.554402openalex-snapshot
On the rank minimization problem over a positive semidefinite linear matrix inequality
inferred← citeshttps://doi.org/10.1137/1.9780898719833.ch14openalex-snapshot
14. Bilinearity and Complementarity in Robust Control
inferred← citeshttps://doi.org/10.1137/s0895479800377927openalex-snapshot
Some New Results for the Semidefinite Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/s1052623498336450openalex-snapshot
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
inferred← citeshttps://doi.org/10.3390/math8020153openalex-snapshot
A Lifting-Penalty Method for Quadratic Programming with a Quadratic Matrix Inequality Constraint
inferred← citeshttps://doi.org/10.70675/9b7c2836z3e66z49efz8aa2z8c1772c8609dopenalex-snapshot
DC programming and DCA combinatorial optimization and polynomial optimization via SDP techniques
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.