Showing 161 - 180 results of 2,140 for search 'constraints optimization problem', query time: 0.15s Refine Results
  1. 161

    Optimal scalable redeployment algorithm of relay nodes in wireless sensor networks by Bin ZENG, Jun WEI, Lu YAO

    Published 2012-04-01
    “…A relay node redeployment algorithm was proposed to find the optimal location of redeployment relay node when an existed relay node was overloaded considering the multi-dimensional localization and bandwidth constraint.The algorithm translated the redeployment problem into the optimal location planning in a multi-dimensional Euclidean space and then gave the suitable redeployment plan through searching the intersections of transmission areas heuristically.The correctness and completeness of the algorithm were proved.Furthermore,an optimization method was proposed to reduce the complexity of the algorithm to the linear function of the number of sensor nodes.The simulation results show that the algorithm can balance the loads of the overloaded relay nodes by joining in the candidate nodes and then prolong the network lifetime.…”
    Get full text
    Article
  2. 162

    Optimal scalable redeployment algorithm of relay nodes in wireless sensor networks by Bin ZENG, Jun WEI, Lu YAO

    Published 2012-04-01
    “…A relay node redeployment algorithm was proposed to find the optimal location of redeployment relay node when an existed relay node was overloaded considering the multi-dimensional localization and bandwidth constraint.The algorithm translated the redeployment problem into the optimal location planning in a multi-dimensional Euclidean space and then gave the suitable redeployment plan through searching the intersections of transmission areas heuristically.The correctness and completeness of the algorithm were proved.Furthermore,an optimization method was proposed to reduce the complexity of the algorithm to the linear function of the number of sensor nodes.The simulation results show that the algorithm can balance the loads of the overloaded relay nodes by joining in the candidate nodes and then prolong the network lifetime.…”
    Get full text
    Article
  3. 163

    Necessary Conditions for Weak Sharp Minima in Cone-Constrained Optimization Problems by W. Y. Zhang, S. Xu, S. J. Li

    Published 2012-01-01
    “…We study weak sharp minima for optimization problems with cone constraints. Some necessary conditions for weak sharp minima of higher order are established by means of upper Studniarski or Dini directional derivatives. …”
    Get full text
    Article
  4. 164

    Pontryagin’s Principle-Based Algorithms for Optimal Control Problems of Parabolic Equations by Weilong You, Fu Zhang

    Published 2025-03-01
    “…This paper applies the Method of Successive Approximations (MSA) based on Pontryagin’s principle to solve optimal control problems with state constraints for semilinear parabolic equations. …”
    Get full text
    Article
  5. 165

    Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem by A. Ed-dahdah, M. Laghdir, M. Echchaabaoui, M. Mabrouk

    Published 2025-06-01
    “…The aim of this paper is to establish sequential necessary and sufficient approximate optimality conditions for a constrained convex vector mini-mization problem without any constraint qualifications, characterizing the approximate proper and weak efficient solutions. …”
    Get full text
    Article
  6. 166

    An Improvement of the Alternating Direction Method of Multipliers to Solve the Convex Optimization Problem by Jingjing Peng, Zhijie Wang, Siting Yu, Zengao Tang

    Published 2025-02-01
    “…The alternating direction method is one of the attractive approaches for solving convex optimization problems with linear constraints and separable objective functions. …”
    Get full text
    Article
  7. 167

    Improving the Solving of Optimization Problems: A Comprehensive Review of Quantum Approaches by Deborah Volpe, Giacomo Orlandi, Giovanna Turvani

    Published 2025-01-01
    “…It demonstrates their application to real-world scenarios and outlines the steps to convert generic optimization problems into quantum-compliant models. …”
    Get full text
    Article
  8. 168

    The Patch-Levy-Based Bees Algorithm Applied to Dynamic Optimization Problems by Wasim A. Hussein, Siti Norul Huda Sheikh Abdullah, Shahnorbanun Sahran

    Published 2017-01-01
    “…Many real-world optimization problems are actually of dynamic nature. …”
    Get full text
    Article
  9. 169
  10. 170

    Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization by Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka

    Published 2025-01-01
    “…Unfortunately, many optimization problems have constraints, which induces infeasible solutions during VQE process. …”
    Get full text
    Article
  11. 171

    Lagrangian duality in quantum optimization: Overcoming QUBO limitations for constrained problems by Einar Gabbassov, Gili Rosenberg, Artur Scherer

    Published 2025-06-01
    “…Within the setting of circuit-model fault-tolerant quantum computation, we demonstrate that this approach achieves a quadratic improvement in circuit depth and maintains a constraint-independent circuit width in contrast with the prevalent approach of solving constrained problems via reformulations based on the quadratic unconstrained binary optimization (QUBO) framework. …”
    Get full text
    Article
  12. 172

    Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs by Adrien Durand, Timothé Watteau, Georges Ghazi, Ruxandra Mihaela Botez

    Published 2024-09-01
    “…This complexity becomes even more challenging when constraints make the problem non-additive, thereby increasing the difficulty of finding the optimal path. …”
    Get full text
    Article
  13. 173

    Explicitly Constrained Black-Box Optimization With Disconnected Feasible Domains Using Deep Generative Models by Naoki Sakamoto, Rei Sato, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto

    Published 2022-01-01
    “…Numerical experiments using a test problem and a topology optimization problem show that the proposed method can find feasible domains with better objective function values and higher probability than both conventional decoder-based constraint-handling methods and non-decoder-based constraint-handling methods.…”
    Get full text
    Article
  14. 174
  15. 175

    An Active-Set Algorithm for Convex Quadratic Programming Subject to Box Constraints with Applications in Non-Linear Optimization and Machine Learning by Konstantinos Vogklis, Isaac E. Lagaris

    Published 2025-04-01
    “…A quadratic programming problem with positive definite Hessian subject to box constraints is solved, using an active-set approach. …”
    Get full text
    Article
  16. 176

    Dimensional Synthesis of Parallel Robots Using Bilevel Optimization for Design Optimization and Resolution of Functional Redundancy by Moritz Schappler

    Published 2025-03-01
    “…The framework produces many possible task-optimal structures despite numerous constraints and can be applied to other problems as an open-source <span style="font-variant: small-caps;">Matlab</span> toolbox.…”
    Get full text
    Article
  17. 177

    AN ALGORITHM FOR COMPUTING BOUNDARY POINTS OF REACHABLE SETS OF CONTROL SYSTEMS UNDER INTEGRAL CONSTRAINTS by Mikhail I. Gusev

    Published 2017-07-01
    “…Under  controllability assumptions it was  proved [8] that any admissible control, that steers the control system to the boundary of its reachable set, is a local solution to an optimal control problem with an integral cost functional and terminal constraints. …”
    Get full text
    Article
  18. 178

    A Novel Optimization Algorithm Inspired by Egyptian Stray Dogs for Solving Multi-Objective Optimal Power Flow Problems by Mohamed H. ElMessmary, Hatem Y. Diab, Mahmoud Abdelsalam, Mona F. Moussa

    Published 2024-12-01
    “…One of the most important issues that can significantly affect the electric power network’s ability to operate sustainably is the optimal power flow (OPF) problem. It involves reaching the most efficient operating conditions for the electrical networks while maintaining reliability and systems constraints. …”
    Get full text
    Article
  19. 179

    An Extensive Study Using the Beetle Swarm Method to Optimize Single and Multiple Objectives of Various Optimal Power Flow Problems by K. Sriram, S. P. Mangaiyarkarasi, S. Sakthivel, L. Jebaraj

    Published 2023-01-01
    “…This article deals with the use of beetle swarm optimization algorithm (BSOA), for optimal power flow (OPF) solution, in an effective approach. …”
    Get full text
    Article
  20. 180