Search Results - nonlinear programming cutting ((pine OR ine) OR life) algorithms sequential linear programming*

  • Showing 1 - 7 results of 7
Refine Results
  1. 1

    Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm by Still, Claus, Westerlund, Tapio

    ISSN: 0926-6003, 1573-2894
    Published: New York Springer Nature B.V 01.05.2006
    “… A Sequential Cutting Plane (SCP) algorithm is used for solving the nonlinear programming problems by solving a sequence of linear programming problems…”
    Get full text
    Journal Article
  2. 2

    Global optimization of general nonconvex problems with intermediate polynomial substructures by Zorn, Keith, Sahinidis, Nikolaos V.

    ISSN: 0925-5001, 1573-2916
    Published: Boston Springer US 01.07.2014
    Published in Journal of global optimization (01.07.2014)
    “… These cutting plane strategies simultaneously convexify linear and nonlinear terms from multiple constraints and are highly effective at tightening standard linear programming relaxations generated…”
    Get full text
    Journal Article
  3. 3

    Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs by Sherali, Hanif D., Dalkiran, Evrim

    ISSN: 0925-5001, 1573-2916
    Published: Boston Springer US 01.11.2011
    Published in Journal of global optimization (01.11.2011)
    “…)-based linear programming (LP) relaxations. We introduce a new class of bound-grid-factor constraints that can be judiciously used to augment the basic RLT relaxations in order to improve the quality of lower bounds and enhance the performance…”
    Get full text
    Journal Article
  4. 4

    Decision Rule Approaches for Pessimistic Bilevel Linear Programs under Moment Ambiguity with Facility Location Applications by Goyal, Akshit, Zhang, Yiling, He, Chuan

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 07.06.2022
    Published in arXiv.org (07.06.2022)
    “…We study a pessimistic stochastic bilevel program in the context of sequential two-player games, where the leader makes a binary here-and-now decision, and the follower responds a continuous wait…”
    Get full text
    Paper
  5. 5

    A simple Newton method for local nonsmooth optimization by Lewis, Adrian, Wylie, Calvin

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 26.07.2019
    Published in arXiv.org (26.07.2019)
    “… Even in the convex case, the subgradient method is very slow, and while some cutting plane algorithms, including traditional bundle methods, are popular in practice, local convergence is still sluggish…”
    Get full text
    Paper
  6. 6

    Optimizing battery discharge management of PMSM vehicles using adaptive nonlinear predictive control and a Generalized Integrator by Ismail, Moustafa Magdi, Al-Dhaifallah, Mujahed, Rezk, Hegazy, Rahman Habib, Habib Ur, Hamad, Samir A.

    ISSN: 2090-4479
    Published: Elsevier B.V 01.12.2024
    Published in Ain Shams Engineering Journal (01.12.2024)
    “… The model employs a Sequential Quadratic Programming (SQP) algorithm, ensuring numerical stability and efficiency within the Model Predictive Control (MPC…”
    Get full text
    Journal Article
  7. 7

    Network Slicing and NOMA Enabled Mobile Edge Computing for Next-Generation Networks by Hossain, Mohammad Arif

    ISBN: 9798383599174
    Published: ProQuest Dissertations & Theses 01.01.2024
    “… To address these challenges, a mixed-integer nonlinear programming (MINLP) problem is formulated and tackled, utilizing heuristic algorithms to simultaneously…”
    Get full text
    Dissertation