Search results for "optimization"

OnMLM: An Online Formulation for the Minimal Learning Machine

2019

Minimal Learning Machine (MLM) is a nonlinear learning algorithm designed to work on both classification and regression tasks. In its original formulation, MLM builds a linear mapping between distance matrices in the input and output spaces using the Ordinary Least Squares (OLS) algorithm. Although the OLS algorithm is a very efficient choice, when it comes to applications in big data and streams of data, online learning is more scalable and thus applicable. In that regard, our objective of this work is to propose an online version of the MLM. The Online Minimal Learning Machine (OnMLM), a new MLM-based formulation capable of online and incremental learning. The achievements of OnMLM in our…

Approximations and Metric Regularity in Mathematical Programming in Banach Space

1993

This paper establishes verifiable conditions ensuring the important notion of metric regularity for general nondifferentiable programming problems in Banach spaces. These conditions are used to obtain Lagrange-Kuhn-Tucker multipliers for minimization problems with infinitely many inequality and equality constraints.

A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning

2003

We propose a new method for finding the minimum ratio-cut of a graph. Ratio-cut is NP-hard problem for which the best previously known algorithm gives an O(log n)-factor approximation by solving its dually related maximum concurrent flow problem.We formulate the minimum ratio-cut as a certain nondifferentiable optimization problem, and show that the global minimum of the optimization problem is equal to the minimum ratio-cut. Moreover, we provide strong symbolic computation based evidence that any strict local minimum gives an approximation by a factor of 2. We also give an efficient heuristic algorithm for finding a local minimum of the proposed optimization problem based on standard nondi…

Graph Topology Learning and Signal Recovery Via Bayesian Inference

2019

The estimation of a meaningful affinity graph has become a crucial task for representation of data, since the underlying structure is not readily available in many applications. In this paper, a topology inference framework, called Bayesian Topology Learning, is proposed to estimate the underlying graph topology from a given set of noisy measurements of signals. It is assumed that the graph signals are generated from Gaussian Markov Random Field processes. First, using a factor analysis model, the noisy measured data is represented in a latent space and its posterior probability density function is found. Thereafter, by utilizing the minimum mean square error estimator and the Expectation M…

An improved iterative nonlinear least square approximation method for the design of measurement-based wideband mobile radio channel simulators

2011

This paper deals with the design of measurement-based simulation models for wideband single-input single-output (SISO) mobile radio channels. We present an improved version of the iterative nonlinear least square approximation (INLSA) method for computing the parameters of measurement-based simulation models. The proposed method aims to fit the temporal-frequency correlation function (TFCF) of the simulation model to that of the measured channel. Unlike the original INLSA method, the proposed approach provides a unique optimal set of estimated model parameters. The proposed iterative procedure involves numerical optimization techniques to determine a set of parameters that minimizes the Euc…

Mixed integer optimal compensation: Decompositions and mean-field approximations

2012

Mixed integer optimal compensation deals with optimizing integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this issue, we propose a decomposition method which turns the original n-dimensional problem into n independent scalar problems of lot sizing form. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon. This last reformulation step mirrors a standard procedure in mixed integer programming. We apply the decomposition method to a mean-field coupled multi-agent s…

2014

This paper deals with the problem of robust model predictive control (RMPC) for a class of linear time-varying systems with constraints and data losses. We take the polytopic uncertainties into account to describe the uncertain systems. First, we design a robust state observer by using the linear matrix inequality (LMI) constraints so that the original system state can be tracked. Second, the MPC gain is calculated by minimizing the upper bound of infinite horizon robust performance objective in terms of linear matrix inequality conditions. The method of robust MPC and state observer design is illustrated by a numerical example.

Molecular basis of the interaction of novel tributyltin(IV) 2/4-[(E)-2-(aryl)-1-diazenyl] benzoates endowed with an improved cytotoxic profile: Synth…

2010

A series of tributyltin(IV) complexes based on 2/4-[(E)-2-(aryl)-1-diazenyl]benzoate ligands was synthesized, wherein the position of the carboxylate and aryl substituents (methyl, tert-butyl and hydroxyl) varies. The complexes, Bu(3)SnL(1-4)H (1-4), have been structurally characterized by elemental analysis and IR, NMR ((1)H, (13)C, and (119)Sn) and (119)Sn Mossbauer spectroscopy. All have a tetrahedral geometry in solution and a trigonal bipyramidal geometry in the solid-state, except for Bu(3)SnL(4)H (4) that was ascertained to have tetrahedral coordination by X-ray crystallography. Cytotoxicity studies were carried out on human tumor cell lines A498 (renal cancer), EVSA-T (mammary cance…

Mean‐Variance Portfolio Optimization

2010

Measurement of branching fractions and charge asymmetries for exclusive B decays to charmonium

2005

We report measurements of branching fractions and charge asymmetries of exclusive decays of neutral and charged B mesons into two-body final states containing a charmonium state and a light strange meson. The charmonium mesons considered are J/Psi, Psi(2S) and Chi_c1, and the light meson is either K or K*. We use a sample of about 124 million BBbar events collected with the BABAR detector at the PEP-II storage ring at the Stanford Linear Accelerator Center.