Results 11 to 20 of about 67,874 (310)
Exploiting Block Structures of KKT Matrices for Efficient Solution of Convex Optimization Problems
IEEE 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
Predictive online convex optimization [PDF]
Automatica, 2020 We incorporate future information in the form of the estimated value of future gradients in online convex optimization. This is motivated by demand response in power systems, where forecasts about the current round, e.g., the weather or the loads' behavior, can be used to improve on predictions made with only past observations.
Antoine Lesage-Landry +2 more
openaire +4 more sources
Applied 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
RBCC Mid-section Combined Trajectory Optimization Method Based on Particle Swarm-Pseudospectral Convex Optimization [PDF]
Hangkong bingqiIn 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
Bandwidth Maximization of Disturbance Observer Based on Experimental Frequency Response Data
SICE 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
On Mixed-Integer Random Convex Programs [PDF]
, 2012 We consider a class of mixed-integer optimization problems subject to N randomly drawn convex constraints. We provide explicit bounds on the tails of the probability that the optimal solution found under these N constraints will become infeasible for the
D. Lyons +8 more
core +1 more source
Convex Optimization on Banach Spaces [PDF]
Foundations of Computational Mathematics, 2015 Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space $X$. Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper bounds for the convergence rate of the proposed algorithms are given.
Ronald A. DeVore, Vladimir N. Temlyakov
openaire +2 more sources
Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
Open Mathematics, 2019 This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj +1 more source
Convex Matroid Optimization [PDF]
SIAM Journal on Discrete Mathematics, 2003 We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.
openaire +3 more sources
A Note on Optimality Conditions for DC Programs Involving Composite Functions
Abstract and Applied Analysis, 2014 By using the formula of the ε-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained.
Xiang-Kai Sun, Hong-Yong Fu
doaj +1 more source