Results 21 to 30 of about 619,204 (327)
On representations of the feasible set in convex optimization [PDF]
, 2009 We consider the convex optimization problem $\min \{f(x) : g_j(x)\leq 0, j=1,...,m\}$ where $f$ is convex, the feasible set K is convex and Slater's condition holds, but the functions $g_j$ are not necessarily convex.
A. Ben-Tal +8 more
core +4 more sources
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
Multimodularity, Convexity, and Optimization Properties [PDF]
Mathematics of Operations Research, 2000 In this paper we investigate the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek and we generalize some of his results. In particular, we extend the relation between convexity and multimodularity to some convex subsets of ℤm. We also obtain general optimization results for average
Altman, Eitan +2 more
openaire +6 more sources
Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization [PDF]
, 2013 Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise. In order to promote sparsity more strongly than convex regularization, it is also standard practice to employ non-convex ...
Chen, Po-Yu, Selesnick, Ivan W.
core +1 more source
Projections Onto Convex Sets (POCS) Based Optimization by Lifting [PDF]
, 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
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 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 Temlyakov
openaire +3 more sources
Journal of Inequalities and Applications, 2019 In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization.
Q. L. Dong +4 more
doaj +1 more source
Hypothesis testing by convex optimization [PDF]
Electronic Journal of Statistics, 2015 We discuss a general approach to handling "multiple hypotheses" testing in the case when a particular hypothesis states that the vector of parameters identifying the distribution of observations belongs to a convex compact set associated with the hypothesis. With our approach, this problem reduces to testing the hypotheses pairwise.
Goldenshluger, Alexander +2 more
openaire +5 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