Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions

1996 ◽  
Vol 6 (2) ◽  
pp. 362-372 ◽  
Author(s):  
B. M. Glover ◽  
Y. Ishizuka ◽  
V. Jeyakumar ◽  
H. D. Tuan
Keyword(s):  
Global Optimality ◽  
Sublinear Functions

scholarly journals Certifying Global Optimality for the L∞-Norm Computation of Large-Scale Descriptor Systems

2020 ◽  
Vol 53 (2) ◽  
pp. 4279-4284
Author(s):  
P. Schwerdtner ◽  
E. Mengi ◽  
M. Voigt
Keyword(s):  
Large Scale ◽  
Descriptor Systems ◽  
Global Optimality

scholarly journals Identification of mechanical properties of arteries with certification of global optimality

2021 ◽  
Author(s):  
Jan-Lucas Gade ◽  
Carl-Johan Thore ◽  
Jonas Stålhand
Keyword(s):  
Global Solution ◽  
Branch And Bound ◽  
Clinical Data ◽  
Minimization Problem ◽  
Branch And Bound Algorithm ◽  
Stationary Points ◽  
Model Parameters ◽  
Global Optimality ◽  
Clinical Value ◽  
Non Linear

AbstractIn this study, we consider identification of parameters in a non-linear continuum-mechanical model of arteries by fitting the models response to clinical data. The fitting of the model is formulated as a constrained non-linear, non-convex least-squares minimization problem. The model parameters are directly related to the underlying physiology of arteries, and correctly identified they can be of great clinical value. The non-convexity of the minimization problem implies that incorrect parameter values, corresponding to local minima or stationary points may be found, however. Therefore, we investigate the feasibility of using a branch-and-bound algorithm to identify the parameters to global optimality. The algorithm is tested on three clinical data sets, in each case using four increasingly larger regions around a candidate global solution in the parameter space. In all cases, the candidate global solution is found already in the initialization phase when solving the original non-convex minimization problem from multiple starting points, and the remaining time is spent on increasing the lower bound on the optimal value. Although the branch-and-bound algorithm is parallelized, the overall procedure is in general very time-consuming.

scholarly journals Bi-objective design-for-control of water distribution networks with global bounds

2021 ◽  
Author(s):  
Aly-Joy Ulusoy ◽  
Filippo Pecci ◽  
Ivan Stoianov
Keyword(s):  
Water Distribution ◽  
Distribution Networks ◽  
Water Distribution Networks ◽  
Mixed Integer ◽  
Global Optimality ◽  
Linear Programs ◽  
Design For Control ◽  
Non Linear ◽  
Feasible Solutions

AbstractThis manuscript investigates the design-for-control (DfC) problem of minimizing pressure induced leakage and maximizing resilience in existing water distribution networks. The problem consists in simultaneously selecting locations for the installation of new valves and/or pipes, and optimizing valve control settings. This results in a challenging optimization problem belonging to the class of non-convex bi-objective mixed-integer non-linear programs (BOMINLP). In this manuscript, we propose and investigate a method to approximate the non-dominated set of the DfC problem with guarantees of global non-dominance. The BOMINLP is first scalarized using the method of $$\epsilon $$ ϵ -constraints. Feasible solutions with global optimality bounds are then computed for the resulting sequence of single-objective mixed-integer non-linear programs, using a tailored spatial branch-and-bound (sBB) method. In particular, we propose an equivalent reformulation of the non-linear resilience objective function to enable the computation of global optimality bounds. We show that our approach returns a set of potentially non-dominated solutions along with guarantees of their non-dominance in the form of a superset of the true non-dominated set of the BOMINLP. Finally, we evaluate the method on two case study networks and show that the tailored sBB method outperforms state-of-the-art global optimization solvers.

scholarly journals Pointwise multiple averages for sublinear functions

2018 ◽  
Vol 40 (6) ◽  
pp. 1594-1618
Author(s):  
SEBASTIÁN DONOSO ◽  
ANDREAS KOUTSOGIANNIS ◽  
WENBO SUN
Keyword(s):  
Large Class ◽  
Explicit Formula ◽  
Pointwise Convergence ◽  
Limit Function ◽  
Invariant Property ◽  
Ergodic Averages ◽  
Order Zero ◽  
Good For ◽  
Sublinear Functions ◽  
Uniquely Ergodic

For any measure-preserving system $(X,{\mathcal{B}},\unicode[STIX]{x1D707},T_{1},\ldots ,T_{d})$ with no commutativity assumptions on the transformations $T_{i},$$1\leq i\leq d,$ we study the pointwise convergence of multiple ergodic averages with iterates of different growth coming from a large class of sublinear functions. This class properly contains important subclasses of Hardy field functions of order zero and of Fejér functions, i.e., tempered functions of order zero. We show that the convergence of the single average, via an invariant property, implies the convergence of the multiple one. We also provide examples of sublinear functions which are, in general, bad for convergence on arbitrary systems, but good for uniquely ergodic systems. The case where the fastest function is linear is addressed as well, and we provide, in all the cases, an explicit formula of the limit function.

scholarly journals Partially distributed outer approximation

2021 ◽  
Author(s):  
Alexander Murray ◽  
Timm Faulwasser ◽  
Veit Hagenmeyer ◽  
Mario E. Villanueva ◽  
Boris Houska
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Outer Approximation ◽  
Mixed Integer ◽  
Global Optimality ◽  
Integer Optimization ◽  
Global Minimizers ◽  
Outer Approximation Method ◽  
Coupling Constraints ◽  
Outer Approximation Algorithm

AbstractThis paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming problems to global optimality. The proposed scheme uses an iterative outer approximation method for coupled mixed integer optimization problems with separable convex objective functions, affine coupling constraints, and compact domain. PaDOA proceeds by alternating between solving large-scale structured mixed-integer linear programming problems and partially decoupled mixed-integer nonlinear programming subproblems that comprise much fewer integer variables. We establish conditions under which PaDOA converges to global minimizers after a finite number of iterations and verify these properties with an application to thermostatically controlled loads and to mixed-integer regression.

scholarly journals Measurement Feedback Self-Tuning Weighted Measurement Fusion Kalman Filter for Systems with Correlated Noises

2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
Xin Wang ◽  
Shu-Li Sun
Keyword(s):  
Kalman Filter ◽  
Stochastic Systems ◽  
Tracking System ◽  
Weighted Least Squares ◽  
Full Rank ◽  
Global Optimality ◽  
Measurement Feedback ◽  
Innovation Model ◽  
Self Tuning ◽  
Noise Statistics

For the linear discrete stochastic systems with multiple sensors and unknown noise statistics, an online estimators of the noise variances and cross-covariances are designed by using measurement feedback, full-rank decomposition, and weighted least squares theory. Further, a self-tuning weighted measurement fusion Kalman filter is presented. The Fadeeva formula is used to establish ARMA innovation model with unknown noise statistics. The sampling correlated function of the stationary and reversible ARMA innovation model is used to identify the noise statistics. It is proved that the presented self-tuning weighted measurement fusion Kalman filter converges to the optimal weighted measurement fusion Kalman filter, which means its asymptotic global optimality. The simulation result of radar-tracking system shows the effectiveness of the presented algorithm.

Sign in / Sign up

Export Citation Format

Share Document