Suchergebnisse - Monotone Linear Programming Circuits

A general projection neural network for solving monotone variational inequalities and related optimization problems von Xia, Y., Wang, J.

“… Recently, a projection neural network for solving monotone variational inequalities and constrained optimization problems was developed …”
Volltext

A Neurodynamic Model to Solve Nonlinear Pseudo-Monotone Projection Equation and Its Applications von Eshaghnezhad, Mohammad, Effati, Sohrab, Mansoori, Amin

“… In this paper, a neurodynamic model is given to solve nonlinear pseudo-monotone projection equation …”
Volltext

A Novel Hybrid Monotonic Local Search Algorithm for FIR Filter Coefficients Optimization von Shahein, Ahmed, Zhang, Q., Lotze, N., Manoli, Y.

“… ) coefficients as a mixed integer linear problem and solves it heuristically. The optimization problem is formulated to minimize the number of nonzero bits in each coefficient without violating the filter specifications within the pass and stop bands …”
Volltext

Hardness of circuit and monotone diameters of polytopes von Nöbel, Christian, Steiner, Raphael

“… The Circuit diameter of polytopes was introduced by Borgwardt, Finhold and Hemmecke as a fundamental tool for the study of circuit augmentation schemes for linear programming and for estimating combinatorial diameters …”
Volltext

Global Attractivity in Delayed Hopfield Neural Network Models von van den Driessche, P., Zou, Xingfu

“… In the case of monotone and smooth activation functions, the theory of monotone dynamical systems is applied to obtain criteria for global attractivity of the delayed model …”
Volltext

On the circuit diameter conjecture for counterexamples to the Hirsch conjecture von Black, Alexander E., Borgwardt, Steffen, Brugger, Matthias

“… Circuit diameters of polyhedra are a fundamental tool for studying the complexity of circuit augmentation schemes for linear programming and for finding lower bounds on combinatorial diameters …”
Volltext

Improvement of sensitivity band technique for worst case tolerance analysis of linear circuits von Sunun, M., Uatrongjit, S.

“… In case of non-monotonic parameters, a linear programming technique is applied to find the circuit response enclosure …”
Volltext

Monotonic Optimization Framework for the Two-User MISO Interference Channel von Jorswieck, Eduard A, Larsson, Erik G

“… ) operating points are non-linear and non-convex. In this paper, we develop a non-convex optimization framework based on monotonic optimization by outer polyblock approximation …”
Volltext

Dynamic Decoupling-Based Convex-Concave Programming for Optimal Power Flow in Asymmetric Bipolar DC Distribution Networks von Zhou, Yiyao, Wang, Qianggang, Chicco, Gianfranco, Liao, Jianquan, Chi, Yuan, Huang, Tao, Wu, Haoke, Zhou, Niancheng

“… Hence, this paper proposes a dynamic decoupling-based convex-concave programming (CCP) framework to formulate an OPF model, aiming for a more rational impact across diverse applications in asymmetric operational bipolar DCDNs …”
Volltext

Retiming edge-triggered circuits under general delay models von Lalgudi, K.N., Papaefthymiou, M.C.

“… For the most general of our delay models, we express the retiming problem as a set of integer linear programming (ILP …”
Volltext

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits von Bazzi, Abbas, Fiorini, Samuel, Huang, Sangxia, Svensson, Ola

“… In spite of their widespread use, these inequalities yield linear programming (LP) relaxations of exponential size, over which it is not known how to optimize exactly in polynomial time …”
Volltext

Cutting planes cannot approximate some integer programs von Jukna, Stasys, Schnitger, Georg

“… For every positive integer l, we consider a zero–one linear program describing the following optimization problem …”
Volltext

Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks von Pham, Dung V., Nguyen, Giang L., Nguyen, Tu N., Pham, Canh V., Nguyen, Anh V.

“… In this paper, we propose a Multiple Topics Linear Threshold …”
Volltext

Inapproximability of shortest paths on perfect matching polytopes: Inapproximability of shortest paths on perfect matching polytopes von Cardinal, Jean, Steiner, Raphael

“… We consider the computational problem of finding short paths in the skeleton of the perfect matching polytope of a bipartite graph. We prove that unless P = NP …”
Volltext

CONVERGENCE OF TIME-STEPPING SCHEMES FOR PASSIVE AND EXTENDED LINEAR COMPLEMENTARITY SYSTEMS von HAN, LANSHAN, TIWARI, ALOK, CAMLIBEL, M. KANAT, PANG, JONG-SHI

“… Generalizing recent results in [M. K. Camlibel, Complementarity Methods in the Analysis of Piecewise Linear Dynamical Systems, Ph.D …”
Volltext

Targeted Protection Maximization in Social Networks von Guo, Jianxiong, Li, Yi, Wu, Weili

“… >. Under the IC-model, the objective function of TPM is monotone non-decreasing, but not submodular …”
Volltext

On spherical codes with inner products in a prescribed interval von Boyvalenkov, P. G., Dragnev, P. D., Hardin, D. P., Saff, E. B., Stoyanova, M. M.

“… We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval [ ℓ , s ] of [ - 1 , 1 …”
Volltext

Exponential stability of globally projected dynamic systems von Gao, Xing-Bao

“… ), whose equilibria solve the associated variational inequality problems. Two sufficient conditions are provided to ensure the asymptotic stability of this system with a monotone and asymmetric mapping by means of an energy function …”
Volltext

Information Equilibrium Maximization Problem in Social Networks Based on Entropy von Li, Runzhi, Zhu, Jianming, Wang, Guoqing

“… Personal cognition, product advertising and social recommendations are important factors to develop brand preferences, which directly influence consumer …”
Volltext

Diversified Budgeted Influence Maximization in Dynamic Social Networks von Meena, Sunil Kumar, Singh, Shashank Sheshar, Singh, Kuldeep

“… Influence maximization is a fundamental problem in network analysis, which attempts to identify a subset of nodes that maximizes the spread of …”
Volltext