-
1301
Asynchronous Gossip-Based Gradient-Free Method for Multiagent Optimization
Published 2014-01-01“…We prove that with probability 1 the iterates of all agents converge to the same optimal point of the problem, for a diminishing step size.…”
Get full text
Article -
1302
Algorithm of video object segmentation based on region Gibbs potential function
Published 2005-01-01“…The optimization of solution was carried out by iterated conditional mode (ICM) method. The experiment results show that the algorithm is more effective than COST 211 analysis model.…”
Get full text
Article -
1303
“This is not science. This is storytelling:” The Poetics of Science in Arcadia
Published 2011-12-01“…The analysis focuses on the poetic use of entropy, unpredictable determinism and iteration in Arcadia, and their structuring role as metaphors of emplotment. …”
Get full text
Article -
1304
Topology Optimization of the Network with Renewable Energy Sources Generation Based on a Modified Adapted Genetic Algorithm
Published 2022-08-01“…The proposed genetic algorithm used two different functions of interbreeding, the function of mutation, selection of the best individuals and mass mutation (complete population renewal). At the end of each iteration of the algorithm operation, statistical dependencies were de-rived that characterized its work: the best (minimal losses) and average adaptability in the population, a list of the best individuals throughout all iterations, etc. …”
Get full text
Article -
1305
Comparison of Different Analytic Solutions to Axisymmetric Squeezing Fluid Flow between Two Infinite Parallel Plates with Slip Boundary Conditions
Published 2012-01-01“…The velocity profiles are investigated through various analytical techniques like Adomian decomposition method, new iterative method, homotopy perturbation, optimal homotopy asymptotic method, and differential transform method.…”
Get full text
Article -
1306
A Self-Adaptive Technique for Solving Variational Inequalities: A New Approach to the Problem
Published 2022-01-01“…The current study proposed a novel iterative scheme developed through a fixed-point scheme and formulation for solving variational inequalities. …”
Get full text
Article -
1307
Reconfigurable Antenna Arrays with Multiple Requirements: A Versatile 3D Approach
Published 2017-01-01“…The conceived algorithm, which generalizes some existing solutions, relies on a weighted cost function, whose iterative minimization is accomplished by properly derived closed-form expressions. …”
Get full text
Article -
1308
Research on the generalized utility max-min fair algorithm based on piecewise linear function
Published 2006-01-01“…A generalized utility max-min(UMM) fair algorithm of resource allocation based on piecewise linear function was provided,which supported the upper/lower bounds of resource allocation as well as strictly increasing and continu-ous utility functions.Because of the avoidance of iterative procedure,this algorithm was less complex than water-filling,another UMM fair algorithm.And its simplified version had the same complexity as the narrow-sense UMM fair algo-rithm based on piecewise linear function.This algorithm can be applied in various problems of resource allocation in the field of computer and communication.…”
Get full text
Article -
1309
Viscosity Approximation Methods and Strong Convergence Theorems for the Fixed Point of Pseudocontractive and Monotone Mappings in Banach Spaces
Published 2013-01-01“…Suppose that C is a nonempty closed convex subset of a real reflexive Banach space E which has a uniformly Gateaux differentiable norm. A viscosity iterative process is constructed in this paper. A strong convergence theorem is proved for a common element of the set of fixed points of a finite family of pseudocontractive mappings and the set of solutions of a finite family of monotone mappings. …”
Get full text
Article -
1310
The Alternating Direction Method of Multipliers for Sufficient Dimension Reduction
Published 2024-01-01“…Under some assumptions, we prove that the iterative sequence generated by ADMM converges to some point of the associated augmented Lagrangian function. …”
Get full text
Article -
1311
Sparsity-Based Robust Bistatic MIMO Radar Imaging in the Presence of Array Errors
Published 2020-01-01“…The impact of multiplicative array gain-phase errors is changed to be additive through model reformulation, and transmit-receive angle imaging is formulated to a sparse total least square signal problem. Then, an iterative algorithm is proposed to solve the optimization problem. …”
Get full text
Article -
1312
Asymptotic Methods for Solitary Solutions and Compactons
Published 2012-01-01“…Particular attention is paid throughout the paper to giving an intuitive grasp for the variational approach, the Hamiltonian approach, the variational iteration method, the homotopy perturbation method, the parameter-expansion method, the Yang-Laplace transform, the Yang-Fourier transform, and ancient Chinese mathematics. …”
Get full text
Article -
1313
O Prefață uitată a lui Paul Zarifopol
Published 2014-12-01“…The Preface is also an important essay by Zarifopol on the aesthetical experience, alongside more notorious texts such as Recapitulări/ Iterations (1930) or În planul esthetic/ The Aesthetical Level (1933).…”
Get full text
Article -
1314
Research on energy-efficient physical-layer secure transmission mechanism in decode-and-forward cooperative networks
Published 2017-01-01“…The maximization problem of secure energy efficiency (EE) in decode-and-forward relay networks was investigated considering the power and energy constraints in physical-layer secure transmission.An iterative algorithm for power allocation was proposed based on fractional programming and DC (difference of convex functions) programming.This algorithm jointly allocated power for source and relay nodes to achieve energy-efficient secure transmission,subject to the peak power constraint of each node and the minimum secrecy rate requirement of the system.Simulation results demonstrate that the propose algorithm can improve the secure EE significantly compared with the conventional secrecy rate maximization strategy.…”
Get full text
Article -
1315
Semianalytical Approach for the Approximate Solution of Delay Differential Equations
Published 2022-01-01“…The beauty of this approach is that it does not need to compute the values of the Lagrange multiplier as in the variational iteration method, and also, there is no need to implement the convolution theorem as in the Laplace transform. …”
Get full text
Article -
1316
Uniformly convergent schemes for singularly perturbed differential equations based on collocation methods
Published 2000-01-01“…What we say in the current paper is this: when one uses a grid which is not too coarse the resulted solution, even being nonuniformly convergent may be used in an iterated scheme to get a good approximation solution that is uniformly convergent over the whole geometric domain of study.…”
Get full text
Article -
1317
Finite-Time Stability and Stabilization of Networked Control Systems with Bounded Markovian Packet Dropout
Published 2014-01-01“…The main results provided in the paper are sufficient conditions for finite-time stability and stabilization via state feedback. An iterative approach is proposed to model NCSs with bounded packet dropout as jump linear systems (JLSs). …”
Get full text
Article -
1318
Pricing of American Put Option under a Jump Diffusion Process with Stochastic Volatility in an Incomplete Market
Published 2014-01-01“…By employing a risk-minimization criterion, we obtain the Radon-Nikodym derivative for the minimal martingale measure and consequently a linear complementarity problem (LCP) for American option price. An iterative method is then established to solve the LCP problem for American put option price. …”
Get full text
Article -
1319
A Survey on the Integral Means Spectrum for Conformal Mappings
Published 2015-06-01“…The systematic results on the estimation of the integral means spectrum and the well-known law of the iterated logarithm for conformal mappings, which was proven by N.G. …”
Get full text
Article -
1320
Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems
Published 2014-01-01“…The main search direction dk is obtained by solving this (QP) subproblem which is feasible at per iteration point and need not to consider the penalty function by using the filter technique. …”
Get full text
Article