Výsledky vyhľadávania - Monotone Linear Programming Circuits

  1. 1

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

    ISSN: 1045-9227
    Vydavateľské údaje: United States IEEE 01.03.2004
    Vydané v IEEE transactions on neural networks (01.03.2004)
    “…Recently, a projection neural network for solving monotone variational inequalities and constrained optimization problems was developed…”
    Získať plný text
    Journal Article
  2. 2

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

    ISSN: 2168-2267, 2168-2275
    Vydavateľské údaje: United States IEEE 01.10.2017
    Vydané v IEEE transactions on cybernetics (01.10.2017)
    “…In this paper, a neurodynamic model is given to solve nonlinear pseudo-monotone projection equation…”
    Získať plný text
    Journal Article
  3. 3

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

    ISSN: 1549-8328, 1558-0806
    Vydavateľské údaje: New York IEEE 01.03.2012
    “…) 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…”
    Získať plný text
    Journal Article
  4. 4

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 12.04.2024
    Vydané v arXiv.org (12.04.2024)
    “…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…”
    Získať plný text
    Paper
  5. 5

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

    ISSN: 0036-1399, 1095-712X
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.12.1998
    Vydané v SIAM journal on applied mathematics (01.12.1998)
    “… 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…”
    Získať plný text
    Journal Article
  6. 6

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

    ISSN: 1572-5286
    Vydavateľské údaje: Elsevier B.V 01.11.2025
    Vydané v Discrete optimization (01.11.2025)
    “…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…”
    Získať plný text
    Journal Article
  7. 7
  8. 8

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

    ISSN: 0090-6778, 1558-0857
    Vydavateľské údaje: New York IEEE 01.07.2010
    Vydané v IEEE transactions on communications (01.07.2010)
    “…) 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…”
    Získať plný text
    Journal Article
  9. 9

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

    ISSN: 0885-8950, 1558-0679
    Vydavateľské údaje: New York IEEE 01.05.2025
    Vydané v IEEE transactions on power systems (01.05.2025)
    “… 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…”
    Získať plný text
    Journal Article
  10. 10

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

    ISSN: 0278-0070
    Vydavateľské údaje: New York, NY IEEE 01.12.1997
    “… For the most general of our delay models, we express the retiming problem as a set of integer linear programming (ILP…”
    Získať plný text
    Journal Article
  11. 11

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 18.11.2016
    Vydané v arXiv.org (18.11.2016)
    “… 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…”
    Získať plný text
    Paper
  12. 12

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

    ISSN: 0167-6377, 1872-7468
    Vydavateľské údaje: Oxford Elsevier B.V 01.07.2012
    Vydané v Operations research letters (01.07.2012)
    “…For every positive integer l, we consider a zero–one linear program describing the following optimization problem…”
    Získať plný text
    Journal Article
  13. 13

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

    ISSN: 2169-3536, 2169-3536
    Vydavateľské údaje: Piscataway IEEE 2020
    Vydané v IEEE access (2020)
    “… In this paper, we propose a Multiple Topics Linear Threshold…”
    Získať plný text
    Journal Article
  14. 14

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

    ISSN: 0025-5610, 1436-4646
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2025
    Vydané v Mathematical programming (01.03.2025)
    “…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…”
    Získať plný text
    Journal Article
  15. 15

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

    ISSN: 0036-1429, 1095-7170
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.01.2009
    Vydané v SIAM journal on numerical analysis (01.01.2009)
    “…Generalizing recent results in [M. K. Camlibel, Complementarity Methods in the Analysis of Piecewise Linear Dynamical Systems, Ph.D…”
    Získať plný text
    Journal Article
  16. 16

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

    ISSN: 2327-4697, 2334-329X
    Vydavateľské údaje: Piscataway IEEE 01.07.2020
    “…>. Under the IC-model, the objective function of TPM is monotone non-decreasing, but not submodular…”
    Získať plný text
    Journal Article
  17. 17

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

    ISSN: 0925-1022, 1573-7586
    Vydavateľské údaje: New York Springer US 15.03.2019
    Vydané v Designs, codes, and cryptography (15.03.2019)
    “…We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval [ ℓ , s ] of [ - 1 , 1…”
    Získať plný text
    Journal Article
  18. 18

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

    ISSN: 1045-9227
    Vydavateľské údaje: United States IEEE 01.03.2003
    Vydané v IEEE transactions on neural networks (01.03.2003)
    “…), 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…”
    Získať plný text
    Journal Article
  19. 19

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

    ISSN: 2327-4697, 2334-329X
    Vydavateľské údaje: Piscataway IEEE 01.09.2025
    “…Personal cognition, product advertising and social recommendations are important factors to develop brand preferences, which directly influence consumer…”
    Získať plný text
    Journal Article
  20. 20

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

    ISSN: 2329-924X, 2373-7476
    Vydavateľské údaje: Piscataway IEEE 01.08.2025
    “…Influence maximization is a fundamental problem in network analysis, which attempts to identify a subset of nodes that maximizes the spread of…”
    Získať plný text
    Journal Article