Convex Parameterizations and Fidelity Bounds for Nonlinear Identification and Reduced-Order Modelling

Autor: Mark M. Tobenkin, Alexandre Megretski, Ian R. Manchester
Jazyk: angličtina
Rok vydání: 2017
Předmět:
FOS: Computer and information sciences
0209 industrial biotechnology
Mathematical optimization
Optimization problem
MathematicsofComputing_NUMERICALANALYSIS
Proper convex function
Systems and Control (eess.SY)
02 engineering and technology
Machine Learning (cs.LG)
Nonlinear programming
symbols.namesake
020901 industrial engineering & automation
FOS: Electrical engineering
electronic engineering
information engineering

FOS: Mathematics
0202 electrical engineering
electronic engineering
information engineering

Electrical and Electronic Engineering
Mathematics - Optimization and Control
Mathematics
Semidefinite programming
Linear matrix inequality
Computer Science Applications
Computer Science - Learning
Optimization and Control (math.OC)
Control and Systems Engineering
Lagrangian relaxation
Convex optimization
symbols
Second-order cone programming
Computer Science - Systems and Control
020201 artificial intelligence & image processing
Popis: Model instability and poor prediction of long-term behavior are common problems when modeling dynamical systems using nonlinear "black-box" techniques. Direct optimization of the long-term predictions, often called simulation error minimization, leads to optimization problems that are generally non-convex in the model parameters and suffer from multiple local minima. In this work we present methods which address these problems through convex optimization, based on Lagrangian relaxation, dissipation inequalities, contraction theory, and semidefinite programming. We demonstrate the proposed methods with a model order reduction task for electronic circuit design and the identification of a pneumatic actuator from experiment.
Conditionally accepted to IEEE TAC
Databáze: OpenAIRE