Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm

DOI10.1016/J.AUTOMATICA.2022.110738MaRDI QIDQ2103717zbMATH OpenOpenAlexFDO

Authors Roozbeh Abolpour, Maryam Dehghani, Mohammad Reza Hesamzadeh

Publication date 9 December 2022

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2022.110738

zbMATH Keywords

non-convex constraintbilinear feasibility problemmatrix-factorization problempower-flow problem

Mathematics Subject Classification ID

Nonlinear systems in control theory (93C10) Transformations (93B17)

Recommendations

• DC Programming Approaches for BMI and QMI Feasibility Problems
• On the feasibility problem of linear matrix inequalities
• A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables
• scientific article; zbMATH DE number 1495709
• A condition-based algorithm for solving polyhedral feasibility problems

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
• Bilinear matrix inequality‐based nonquadratic controller design for polytopic‐linear parameter varying systems
• Combining Convex–Concave Decompositions and Linearization Approaches for Solving BMIs, With Application to Static Output Feedback
• Generalized bilinear programming. I: Models, applications and linear programming relaxation
• Iterative LMI approach to robust static output feedback control of uncertain polynomial systems with bounded actuators
• Learning the parts of objects by non-negative matrix factorization
• Multiobjective output-feedback control via LMI optimization
• New SOCP relaxation and branching rule for bipartite bilinear programs
• On the synthesis of an integrated active LPV FTC scheme using sliding modes
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• \(L_{1}\) synthesis of a static output controller for positive systems by LMI iteration

Cited in

(1)

• A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems

This page was built for publication: Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103717)