Results 11 to 20 of about 326,649 (319)

Quantum algorithms and lower bounds for convex optimization [PDF]

open access: yesQuantum, 2020
While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization.
Shouvanik Chakrabarti   +3 more
doaj   +1 more source

Exploiting Block Structures of KKT Matrices for Efficient Solution of Convex Optimization Problems

open access: yesIEEE Access, 2021
Convex optimization solvers are widely used in the embedded systems that require sophisticated optimization algorithms including model predictive control (MPC).
Zafar Iqbal   +4 more
doaj   +1 more source

Convex Optimization in Julia [PDF]

open access: yes2014 First Workshop for High Performance Technical Computing in Dynamic Languages, 2014
This paper describes Convex, a convex optimization modeling framework in Julia. Convex translates problems from a user-friendly functional language into an abstract syntax tree describing the problem. This concise representation of the global structure of the problem allows Convex to infer whether the problem complies with the rules of disciplined ...
Stephen Boyd   +5 more
openaire   +2 more sources

Distributed Optimal Scheduling of Electricity–Gas–Heating System Based on Improved Alternating Direction Method of Multipliers

open access: yesApplied Sciences, 2020
With the joint optimization of the electricity−gas−heating system (EGHS) attracting more and more attention, a distributed optimized scheduling framework for EGHS based on an improved alternating direction method of multipliers (ADMM ...
Hanxin Zhu   +3 more
doaj   +1 more source

Convex optimization

open access: yes, 2021
This textbook is based on lectures given by the authors at MIPT (Moscow), HSE (Moscow), FEFU (Vladivostok), V.I. Vernadsky KFU (Simferopol), ASU (Republic of Adygea), and the University of Grenoble-Alpes (Grenoble, France). First of all, the authors focused on the program of a two-semester course of lectures on convex optimization, which is given to ...
Vorontsova, Evgeniya   +3 more
openaire   +2 more sources

RBCC Mid-section Combined Trajectory Optimization Method Based on Particle Swarm-Pseudospectral Convex Optimization [PDF]

open access: yesHangkong bingqi
In order to solve the problem of combined trajectory optimization of RBCC mid-section, a nested optimization method based on particle swarm-pseudospectral convex optimization is proposed.
Yang Yuxuan, Fei Wanghua, Liu Haili, Wang Peichen, Yan Xunliang
doaj   +1 more source

Projections Onto Convex Sets (POCS) Based Optimization by Lifting [PDF]

open access: yes, 2013
Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented.
Bozkurt, A.   +7 more
core   +2 more sources

Bandwidth Maximization of Disturbance Observer Based on Experimental Frequency Response Data

open access: yesSICE Journal of Control, Measurement, and System Integration, 2020
A disturbance observer (DOB) has been widely employed in industrial field due to its simplicity and effectiveness in disturbance rejection. This paper focuses on systematic bandwidth-maximized DOB design by frequency response data-based convex ...
Xiaoke Wang   +2 more
doaj   +1 more source

Communication complexity of convex optimization [PDF]

open access: yes1986 25th IEEE Conference on Decision and Control, 1986
We consider a situation where each of two processors has access to a different convex function \(f_ i\), \(i=1,2\), defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which \(f_ 1+f_ 2\) is minimized, within some prespecified accuracy ...
Zhi-Quan Luo, John N. Tsitsiklis
openaire   +4 more sources

Optimal divisions of a convex body

open access: yesMathematical Inequalities & Applications, 2023
For a convex body $C$ in $\mathbb{R}^d$ and a division of $C$ into convex subsets $C_1,\ldots,C_n$, we can consider $max\{F(C_1),\ldots, F(C_n)\}$ (respectively, $min\{F(C_1),\ldots, F(C_n)\}$), where $F$ represents one of these classical geometric magnitudes: the diameter, the minimal width, or the inradius.
Cañete Martín, Antonio Jesús   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy