Results 31 to 40 of about 34,499 (189)

Linear decomposition approach for a class of nonconvex programming problems

open access: yesJournal of Inequalities and Applications, 2017
This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids.
Peiping Shen, Chunfeng Wang
doaj   +1 more source

A Mixed-Integer Linear Programming Model for the Simultaneous Optimal Distribution Network Reconfiguration and Optimal Placement of Distributed Generation

open access: yesEnergies, 2022
Distributed generation (DG) aims to generate part of the required electrical energy on a small scale closer to the places of consumption. Integration of DG into an existing electric distribution network (EDN) has technical, economic, and environmental ...
Luis A. Gallego Pareja   +2 more
doaj   +1 more source

An Enhanced SDR Based Global Algorithm for Nonconvex Complex Quadratic Programs With Signal Processing Applications

open access: yesIEEE Open Journal of Signal Processing, 2020
In this paper, we consider a class of nonconvex complex quadratic programming (CQP) problems, which find a broad spectrum of signal processing applications.
Cheng Lu, Ya-Feng Liu, Jing Zhou
doaj   +1 more source

Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT

open access: yesJournal of Global Optimization, 2021
Different versions of polyhedral outer approximation are used by many algorithms for mixed-integer nonlinear programming (MINLP). While it has been demonstrated that such methods work well for convex MINLP, extending them to solve nonconvex problems has ...
Andreas Lundell, Jan Kronqvist
semanticscholar   +1 more source

An accelerating algorithm for globally solving nonconvex quadratic programming

open access: yesJournal of Inequalities and Applications, 2018
To globally solve a nonconvex quadratic programming problem, this paper presents an accelerating linearizing algorithm based on the framework of the branch-and-bound method. By utilizing a new linear relaxation approach, the initial quadratic programming
Li Ge, Sanyang Liu
doaj   +1 more source

Sustainable Design and Synthesis of Shale Gas Processing and Chemical Manufacturing Processes

open access: yesChemical Engineering Transactions, 2018
In this work, we propose a superstructure of integrated shale gas processing and chemical manufacturing processes with 51,840 alternative possible process designs.
Jian Gong, Fengqi You
doaj   +1 more source

Magneto‐X Effects in Magnetic Soft Materials and Their Applications

open access: yesAdvanced Science, EarlyView.
This review systematically explores magnetic soft materials (MSMs), a novel class of composites that transform under magnetic fields. It catalogs fundamental “Magneto‐X” effects, classifies materials by their matrix and magnetic fillers, and highlights transformative applications in soft robotics, biomedical devices, flexible electronics, etc. Finally,
Ziyin Xiang   +5 more
wiley   +1 more source

Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development

open access: yesJournal of Global Optimization, 2014
We present a global optimization algorithm, Branch-and-Sandwich, for optimistic bilevel programming problems that satisfy a regularity condition in the inner problem.
Polyxeni-Margarita Kleniati, C. Adjiman
semanticscholar   +1 more source

Trust‐region filter algorithms utilizing Hessian information for gray‐box optimization

open access: yesAIChE Journal, EarlyView.
Abstract Optimizing industrial processes often involves gray‐box models that couple algebraic glass‐box equations with black‐box components lacking analytic derivatives. Such systems challenge derivative‐based solvers. The classical trust‐region filter (TRF) algorithm provides a robust framework but requires extensive parameter tuning and numerous ...
Gul Hameed   +4 more
wiley   +1 more source

Graph‐based imitation and reinforcement learning for efficient Benders decomposition

open access: yesAIChE Journal, EarlyView.
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy