Results 191 to 200 of about 10,157 (257)

Performance improvement of discrete‐time linear‐quadratic regulators applied to uncertain linear systems using the Tikhonov regularization method

open access: yesAsian Journal of Control, EarlyView.
Abstract The linear‐quadratic regulator (LQR) problem of optimal control of an uncertain discrete‐time linear system (DTLS) is revisited in this paper from the perspective of Tikhonov regularization. We show that an optimally chosen regularization parameter reduces, compared to the classical LQR, the values of a scalar error function, as well as the ...
Fernando Pazos, Amit Bhaya
wiley   +1 more source

The Quantum Optimization Benchmarking Library. [PDF]

open access: yesNat Comput Sci
Koch T   +26 more
europepmc   +1 more source

Surrogate Programming and Multipliers in Quasi-convex Programming

SIAM Journal on Control and Optimization, 2004
Summary: A result due to \textit{D. G. Luenberger} [SIAM J. Appl. Math. 16, 1090--1095 (1968; Zbl 0212.23905)] on the existence of multipliers in a quasi-convex programming problem is extended to the case of constraints given by an arbitrary convex cone under a constraint qualification condition more general than Slater's condition.
Jean-Paul Penot, Michel Volle
exaly   +2 more sources

Convex programming for disjunctive convex optimization

Mathematical Programming, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sebastián Ceria, João Soares
openaire   +1 more source

On A characterization of optimality in convex programming

Mathematical Programming, 1976
Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.
Adi Ben-Israel, Aharon Ben-Tal
openaire   +2 more sources

Home - About - Disclaimer - Privacy