Results 41 to 50 of about 1,124 (204)
Global optimization for special reverse convex programming [PDF]
, 2007 A global optimization algorithm is proposed in order to locate the global minimum of the special reverse convex programming which is both nonconvex and nonlinear. Three new strategies are adopted in this paper.
Yanjun Wang +3 more
core +1 more source
Mathematical and Computer Modelling, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shao-Jian Qu, Ying Ji 0001, Ke-Cun Zhang
openaire +2 more sources
Advanced Intelligent Systems, EarlyView.An agentic AI‐driven decision‐support framework for prosumers is proposed, integrating PV generation, load profiling, and multihorizon optimization within a four‐agent architecture. The approach significantly reduces grid dependence, enhances self‐sufficiency and prevents system oversizing.
Adela BÂRA, Simona‐Vasilica OPREA
wiley +1 more source
Optimizing Household Waste Recycling Centre Network Reorganization in Hampshire
Networks, EarlyView.ABSTRACT Local councils across the UK are facing sustained financial pressures, and Household Waste Recycling Centres (HWRCs) are being increasingly considered for closure to reduce expenditure. In 2024, Hampshire County Council, which operates the largest HWRC network in the UK, proposed closing either five or twelve existing sites.
Montree Jaidee +4 more
wiley +1 more source
Computing the nearest euclidean distance matrix with low embedding dimensions [PDF]
, 2013 Euclidean distance embedding appears in many high-profile applications including wireless sensor network localization, where not all pairwise distances among sensors are known or accurate.
Qi, Hou-Duo, Yuan, Xiaoming, Qi, Hou Duo
core +1 more source
Control Design Based on Generalized Lur'e Lyapunov Functions for Sampled‐Data Lur'e Systems
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT This article addresses the synthesis of stabilizing control laws for aperiodic sampled‐data Lur'e systems. Based on a hybrid system representation of the closed‐loop system and a timer‐dependent generalized Lur'e–Postnikov type Lyapunov function, stabilization conditions are obtained by separating decision variables with the application of two
Arthur Scolari Fagundes +2 more
wiley +1 more source
Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development [PDF]
, 2013 We present a global optimization algorithm, Branch-and-Sandwich, for optimistic bilevel programming problems that satisfy a regularity condition in the inner problem.
Kleniati, Polyxeni-Margarita +3 more
core +1 more source
The Complexity of Optimizing over a Simplex, Hypercube or Sphere: A Short Survey [PDF]
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as ...
Klerk, E. de
core +4 more sources
BMC Bioinformatics, 2009 Background Optimization methods allow designing changes in a system so that specific goals are attained. These techniques are fundamental for metabolic engineering.
Sorribas Albert +1 more
doaj +1 more source
Computational Optimization and ApplicationsWe use sensitivity analysis to design bounding-focused discretization (cutting-surface) methods for the global optimization of nonconvex semi-infinite programs (SIPs). We begin by formulating the optimal bounding-focused discretization of SIPs as a max-min problem and propose variants that are more computationally tractable.
Evren Mert Turan +2 more
openaire +3 more sources