Results 61 to 70 of about 9,824 (145)

Semidefinite approximation for mixed binary quadratically constrained quadratic programs [PDF]

open access: yes, 2014
Motivated by applications in wireless communications, this paper develops semidefinite programming (SDP) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation performance.
Hong, Mingyi, Luo, Zhi-Quan, Xu, Zi
core  

On Gain Scheduling Trajectory Stabilization for Nonlinear Systems: Theoretical Insights and Experimental Results

open access: yesInternational Journal of Robust and Nonlinear Control, Volume 35, Issue 6, Page 2142-2155, April 2025.
ABSTRACT Steering a nonlinear system from an initial state to a desired one is a common task in control. While a nominal trajectory can be obtained rather systematically using a model, for example, via numerical optimization, heuristics, or reinforcement learning, the design of a computationally fast and reliable feedback control law that guarantees ...
Nicolas Kessler, Lorenzo Fagiano
wiley   +1 more source

A Convex Optimization Approach to Compute Trapping Regions for Lossless Quadratic Systems

open access: yesInternational Journal of Robust and Nonlinear Control, Volume 35, Issue 6, Page 2425-2436, April 2025.
ABSTRACT Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a bounded set.
Shih‐Chi Liao   +3 more
wiley   +1 more source

Optimal Control for a Class of Chaotic Systems

open access: yesJournal of Applied Mathematics, 2012
This paper proposes the optimal control methods for a class of chaotic systems via state feedback. By converting the chaotic systems to the form of uncertain piecewise linear systems, we can obtain the optimal controller minimizing the upper bound on ...
Jianxiong Zhang, Wansheng Tang
doaj   +1 more source

Data‐Based H∞${H_\infty }$ Optimal Tracking Control of Completely Unknown Linear Systems Under Input Constraints

open access: yesIET Control Theory &Applications, Volume 19, Issue 1, January/December 2025.
This paper presents a novel solution for a constrained H∞$H_\infty$ optimal tracking control problem for LTI systems with unknown models. The proposed approach consists of two novel algorithms including an input constraint model‐based algorithm, and a data‐based algorithm for systems with completely unknown models.
Peyman Ahmadi   +2 more
wiley   +1 more source

Toward the Universal Rigidity of General Frameworks [PDF]

open access: yes, 2011
Let (G,P) be a bar framework of n vertices in general position in R^d, d = d+1) anchors.Comment: v2, a revised version of an earlier submission ...
Alfakih, Abdo Y.   +2 more
core  

Layout Decomposition for Quadruple Patterning Lithography and Beyond

open access: yes, 2014
For next-generation technology nodes, multiple patterning lithography (MPL) has emerged as a key solution, e.g., triple patterning lithography (TPL) for 14/11nm, and quadruple patterning lithography (QPL) for sub-10nm. In this paper, we propose a generic
Pan, David Z., Yu, Bei
core   +1 more source

Energy efficiency maximization in IRS‐aided cooperative WPCN with non‐linear EH users

open access: yesElectronics Letters, Volume 61, Issue 1, January/December 2025.
The paper investigates energy efficiency maximization in intelligent reflecting surfaces aided wireless‐powered communication network with hybrid access point and non‐linear energy harvesting users. The focus is on maximizing energy efficiency at the hybrid access point by jointly optimizing transmit time allocation, power allocation at users, and ...
Bharti Katiyar   +3 more
wiley   +1 more source

Bounding Option Prices Using SDP With Change Of Numeraire [PDF]

open access: yes
Recently, given the first few moments, tight upper and lower bounds of the no arbitrage prices can be obtained by solving semidefinite programming (SDP) or linear programming (LP) problems.
Berc Rustem, Kai Ye, Panos Parpas
core  

Exact Solution Methods for the $k$-item Quadratic Knapsack Problem

open access: yes, 2016
The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization.
A Billionnet   +18 more
core   +2 more sources

Home - About - Disclaimer - Privacy