Suchergebnisse - "surrogate gradient algorithm"

  • Treffer 1 - 17 von 17
Treffer weiter einschränken
  1. 1

    Comments on “Surrogate Gradient Algorithm for Lagrangian Relaxation” von Chang, T. S.

    ISSN: 0022-3239, 1573-2878
    Veröffentlicht: Boston Springer US 01.06.2008
    Veröffentlicht in Journal of optimization theory and applications (01.06.2008)
    “… This note presents not only a surrogate subgradient method, but also a framework of surrogate subgradient methods. Furthermore, the framework can be used not …”
    Volltext
    Journal Article
  2. 2

    Surrogate Gradient Algorithm for Lagrangian Relaxation von Zhao, X., Luh, P. B., Wang, J.

    ISSN: 0022-3239, 1573-2878
    Veröffentlicht: New York, NY Springer 01.03.1999
    Veröffentlicht in Journal of optimization theory and applications (01.03.1999)
    “… The subgradient method is used frequently to optimize dual functions in Lagrangian relaxation for separable integer programming problems. In the method, all …”
    Volltext
    Journal Article
  3. 3

    Synaptic Plasticity Dynamics for Deep Continuous Local Learning (DECOLLE) von Kaiser, Jacques, Mostafa, Hesham, Neftci, Emre

    ISSN: 1662-453X, 1662-4548, 1662-453X
    Veröffentlicht: Switzerland Frontiers Research Foundation 12.05.2020
    Veröffentlicht in Frontiers in neuroscience (12.05.2020)
    “… A growing body of work underlines striking similarities between biological neural networks and recurrent, binary neural networks. A relatively smaller body of …”
    Volltext
    Journal Article
  4. 4

    On the Surrogate Gradient Algorithm for Lagrangian Relaxation von Sun, T., Zhao, Q. C., Luh, P. B.

    ISSN: 0022-3239, 1573-2878
    Veröffentlicht: New York, NY Springer 01.06.2007
    Veröffentlicht in Journal of optimization theory and applications (01.06.2007)
    “… When applied to large-scale separable optimization problems, the recently developed surrogate subgradient method for Lagrangian relaxation (Zhao et al.: J …”
    Volltext
    Journal Article
  5. 5

    On the Surrogate Gradient Algorithm forLagrangian Relaxation von Sun, T, Zhao, Q C, Luh, P B

    ISSN: 0022-3239
    Veröffentlicht: 01.06.2007
    Veröffentlicht in Journal of optimization theory and applications (01.06.2007)
    “… When applied to large-scale separable optimization problems, the recently developed surrogate subgradient method for Lagrangian relaxation (Zhao et al.: J …”
    Volltext
    Journal Article
  6. 6

    The surrogate gradient algorithm for Lagrangian relaxation method von Xing Zhao, Luh, P.B., Jihua Wang

    ISBN: 0780341872, 9780780341876
    ISSN: 0191-2216
    Veröffentlicht: IEEE 1997
    “… A key step of Lagrangian relaxation is to optimize the dual function, and the subgradient method is frequently used when the dual function is …”
    Volltext
    Tagungsbericht
  7. 7

    NUTS-BSNN: A non-uniform time-step binarized spiking neural network with energy-efficient in-memory computing macro von Dinh, Van-Ngoc, Bui, Ngoc-My, Nguyen, Van-Tinh, John, Deepu, Lin, Long-Yang, Trinh, Quang-Kien

    ISSN: 0925-2312
    Veröffentlicht: Elsevier B.V 01.12.2023
    Veröffentlicht in Neurocomputing (Amsterdam) (01.12.2023)
    “… This work introduces a network architecture NUTS-BSNN: A Non-uniform Time-step Binarized Spiking Neural Network. NUTS-BSNN is a fully binarized spiking neural …”
    Volltext
    Journal Article
  8. 8

    Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms von Li, Zhaohui, Wan, Guohua

    ISSN: 0020-7543, 1366-588X
    Veröffentlicht: London Taylor & Francis 02.09.2023
    Veröffentlicht in International journal of production research (02.09.2023)
    “… We study a two-stage hybrid flow shop problem arising from a fine chemicals production facility, where the first stage is a continuous chemical reaction …”
    Volltext
    Journal Article
  9. 9

    Accelerating Level-Value Adjustment for the Polyak Stepsize: Accelerating Level-Value Adjustment for the Polyak Stepsize von Liu, Anbang, Bragin, Mikhail A., Chen, Xi, Guan, Xiaohong

    ISSN: 0022-3239, 1573-2878
    Veröffentlicht: New York Springer US 01.09.2025
    Veröffentlicht in Journal of optimization theory and applications (01.09.2025)
    “… The Polyak stepsize has been widely used in subgradient methods for non-smooth convex optimization. However, calculating the stepsize requires the optimal …”
    Volltext
    Journal Article
  10. 10

    An unpaired pickup and delivery problem with time dependent assignment costs: Application in air cargo transportation von Azadian, Farshid, Murat, Alper, Chinnam, Ratna Babu

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 16.11.2017
    Veröffentlicht in European journal of operational research (16.11.2017)
    “… •A new pickup and delivery problem class with real-world application in air cargo.•A novel decomposition solution algorithm is proposed and tested.•Detailed …”
    Volltext
    Journal Article
  11. 11

    Integrated production and logistics planning: Contract manufacturing and choice of air/surface transportation von Azadian, Farshid, Murat, Alper, Chinnam, Ratna Babu

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 16.11.2015
    Veröffentlicht in European journal of operational research (16.11.2015)
    “… •Production scheduling and transportation planning integration for commit-to-delivery.•Parallel machine scheduling with completion time dependent cost …”
    Volltext
    Journal Article
  12. 12

    Stochastic programming for qualification management of parallel machines in semiconductor manufacturing von Chang, Xiaokun, Dong, Ming

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.03.2017
    Veröffentlicht in Computers & operations research (01.03.2017)
    “… This paper is concerned with the qualification management problem of parallel machines under high uncertainties in the semiconductor manufacturing industry …”
    Volltext
    Journal Article
  13. 13

    An Effective Subgradient Method for Scheduling a Steelmaking-Continuous Casting Process von Kun Mao, Quan-Ke Pan, Tianyou Chai, Luh, Peter B.

    ISSN: 1545-5955, 1558-3783
    Veröffentlicht: New York IEEE 01.07.2015
    “… The steelmaking-continuous-casting (SCC) process, which includes steelmaking, refining and continuous casting, is one of the major bottlenecks of iron and …”
    Volltext
    Journal Article
  14. 14

    Lagrangian relaxation of the generic materials and operations planning model von Rius-Sorolla, G., Maheut, J., Coronado-Hernandez, Jairo R., Garcia-Sabater, J. P.

    ISSN: 1435-246X, 1613-9178
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020
    Veröffentlicht in Central European journal of operations research (01.03.2020)
    “… The supply chain management requires increasingly proposals for the production programming planning that brings together its special singularities. Solving …”
    Volltext
    Journal Article
  15. 15

    Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests von Dai, Bo, Chen, Haoxun, Yang, Genke

    ISSN: 1109-2858, 1866-1505
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2014
    Veröffentlicht in Operational research (01.10.2014)
    “… A carrier collaboration problem with pickup and delivery requests is considered, in which multiple carriers form an alliance to share their pickup and delivery …”
    Volltext
    Journal Article
  16. 16

    Solving assembly scheduling problems with tree-structure precedence constraints: A Lagrangian relaxation approach von Xu, Jingyang, Nagi, Rakesh

    ISSN: 1545-5955, 1558-3783
    Veröffentlicht: New York IEEE 01.07.2013
    “… In this paper, we consider an assembly scheduling problem (ASP) with tree-structured precedence constraints. In our problem, there are a number of work …”
    Volltext
    Journal Article
  17. 17

    Collaborative Planning in Supply Chains by Lagrangian Relaxation von Lanshun Nie, Xiaofei Xu, Dechen Zhan

    ISBN: 9780769525815, 0769525814
    Veröffentlicht: IEEE 01.06.2006
    “… of it. Surrogate gradient algorithm was used to update Lagrangian multipliers, which coordinated decentralized decisions of the facilities in supply chains …”
    Volltext
    Tagungsbericht