18 results
Search Results
2. Predictor-Corrector Methods for General Regularized Nonconvex Variational Inequalities.
- Author
-
Ansari, Qamrul and Balooee, Javad
- Subjects
- *
VARIATIONAL inequalities (Mathematics) , *PREDICTION models , *ALGORITHMS , *ITERATIVE methods (Mathematics) , *STOCHASTIC convergence , *NUMERICAL analysis - Abstract
This paper is devoted to the study of a new class of nonconvex variational inequalities, named general regularized nonconvex variational inequalities. By using the auxiliary principle technique, a new modified predictor-corrector iterative algorithm for solving general regularized nonconvex variational inequalities is suggested and analyzed. The convergence of the iterative algorithm is established under the partially relaxed monotonicity assumption. As a consequence, the algorithm and results presented in the paper overcome incorrect algorithms and results existing in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
3. COMMON SOLUTIONS TO PSEUDOMONOTONE EQUILIBRIUM PROBLEMS.
- Author
-
HIEU, D. V.
- Subjects
- *
ITERATIVE methods (Mathematics) , *VARIATIONAL inequalities (Mathematics) , *EQUILIBRIUM , *ALGORITHMS , *NUMERICAL analysis - Abstract
In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradientcutting algorithm which is extended from the previously known one for variational inequalities to equilibrium problems. The second is a new cyclic hybrid extragradient-cutting algorithm. In the cyclic algorithm, using the known techniques, we can perform and develop practical numerical experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2016
4. A new iterative scheme for numerical reckoning fixed points of total asymptotically nonexpansive mappings.
- Author
-
Pansuwan, Adoon and Sintunavarat, Wutiphol
- Subjects
- *
NONEXPANSIVE mappings , *NUMERICAL analysis , *ITERATIVE methods (Mathematics) , *ALGORITHMS , *ECONOMIC convergence - Abstract
In this paper, we propose a new iterative algorithm to approximate fixed points of total asymptotically nonexpansive mappings in $\operatorname{CAT}(0)$ spaces. We also provide two examples to illustrate the convergence behavior of the proposed algorithm and numerically compare the convergence of the proposed iteration scheme with the existing schemes. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
5. On the Method of Shortest Residuals for Unconstrained Optimization.
- Author
-
Pytlak, R. and Tarnawski, T.
- Subjects
- *
CONJUGATE gradient methods , *APPROXIMATION theory , *NUMERICAL solutions to equations , *ITERATIVE methods (Mathematics) , *MATHEMATICAL optimization , *ALGORITHMS , *STOCHASTIC convergence , *NUMERICAL analysis , *CALCULUS of variations - Abstract
The paper discusses several versions of the method of shortest residuals, a specific variant of the conjugate gradient algorithm, first introduced by Lemaréchal and Wolfe and discussed by Hestenes in a quadratic case. In the paper we analyze the global convergence of the versions considered. Numerical comparison of these versions of the method of shortest residuals and an implementation of a standard Polak–Ribière conjugate gradient algorithm is also provided. It supports the claim that the method of shortest residuals is a viable technique, competitive to other conjugate gradient algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
6. Recent advances in trust region algorithms.
- Author
-
Yuan, Ya-xiang
- Subjects
- *
MATHEMATICAL optimization , *NUMERICAL analysis , *ITERATIVE methods (Mathematics) , *ALGORITHMS , *STOCHASTIC convergence , *MATHEMATICAL regularization - Abstract
Trust region methods are a class of numerical methods for optimization. Unlike line search type methods where a line search is carried out in each iteration, trust region methods compute a trial step by solving a trust region subproblem where a model function is minimized within a trust region. Due to the trust region constraint, nonconvex models can be used in trust region subproblems, and trust region algorithms can be applied to nonconvex and ill-conditioned problems. Normally it is easier to establish the global convergence of a trust region algorithm than that of its line search counterpart. In the paper, we review recent results on trust region methods for unconstrained optimization, constrained optimization, nonlinear equations and nonlinear least squares, nonsmooth optimization and optimization without derivatives. Results on trust region subproblems and regularization methods are also discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
7. Frozen Iterative Methods Using Divided Differences 'à la Schmidt-Schwetlick'.
- Author
-
Grau-Sánchez, Miquel, Noguera, Miquel, and Gutiérrez, José
- Subjects
- *
ITERATIVE methods (Mathematics) , *NUMERICAL analysis , *ALGORITHMS , *SECANT function , *APPROXIMATION theory - Abstract
The main goal of this paper is to study the order of convergence and the efficiency of four families of iterative methods using frozen divided differences. The first two families correspond to a generalization of the secant method and the implementation made by Schmidt and Schwetlick. The other two frozen schemes consist of a generalization of Kurchatov method and an improvement of this method applying the technique used by Schmidt and Schwetlick previously. An approximation of the local convergence order is generated by the examples, and it numerically confirms that the order of the methods is well deduced. Moreover, the computational efficiency indexes of the four algorithms are presented and computed in order to compare their efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
8. On the Maximum Separation of Visual Binaries.
- Author
-
Nouh, M. and Sharaf, M.
- Subjects
- *
BINARY stars , *ALGORITHMS , *COMPUTER systems , *KEPLER'S equation , *ITERATIVE methods (Mathematics) , *NUMERICAL analysis , *MATHEMATICAL optimization - Abstract
In this paper, an efficient algorithm is established for computing the maximum (minimum) angular separation ρ( ρ), the corresponding apparent position angles ( $\theta|_{\rho_{\rm max}}$, $\theta|_{\rho_{\rm min}}$) and the individual masses of visual binary systems. The algorithm uses Reed's formulae (1984) for the masses, and a technique of one-dimensional unconstrained minimization, together with the solution of Kepler's equation for $(\rho_{\rm max}, \theta|_{\rho_{\rm max}})$ and $(\rho_{\rm min}, \theta|_{\rho_{\rm min}})$. Iterative schemes of quadratic coverage up to any positive integer order are developed for the solution of Kepler's equation. A sample of 110 systems is selected from the Sixth Catalog of Orbits (Hartkopf et al.). Numerical studies are included and some important results are as follows: (1) there is no dependence between ρ and the spectral type and (2) a minor modification of Giannuzzi's () formula for the upper limits of ρ functions of spectral type of the primary. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
9. The fast multipole boundary element methods (FMBEM) and its applications in rolling engineering analysis.
- Author
-
Chen, Zejun and Xiao, Hong
- Subjects
- *
ALGORITHMS , *GENERALIZATION , *BOUNDARY element methods , *HARMONIC functions , *ITERATIVE methods (Mathematics) , *ELASTOPLASTICITY , *NUMERICAL analysis - Abstract
Fast multipole boundary element methods (FMBEMs) are developed based on the couple of fast multipole algorithm and generalized minimal residual algorithm. The FMBEMs improve the efficiency of conventional BEMs, accelerate the computing, enlarge the solving scale, and it is applied in various engineering fields. The paper tried to do a brief review for the FMBEMs, and focus on the description of basic principles and applications in rolling engineering. The basic principles and main frameworks of two typical methods of FMBEMs (sphere harmonic function multipole BEM and Taylor series multipole BEM) are briefly described, and then the key numerical iterative and preconditioning techniques suitable for the FMBEMs are introduced. The typical numerical examples are presented, including the elasticity problems, the elastic contact problems and the elastoplasticity problems, etc. The validity and effectiveness of FMBEMs are effectively illustrated by engineering analysis examples. The numerical results suggest that the FMBEMs are suitable for the analysis and solution of large scale rolling engineering problems. The implementation process of numerical analysis can provide useful reference for the applications in other engineering fields. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
10. Solving large sparse linear systems in a grid environment: the GREMLINS code versus the PETSc library.
- Author
-
Jezequel, Fabienne, Couturier, Raphaël, and Denis, Christophe
- Subjects
- *
LINEAR systems , *GEOGRAPHICAL positions , *SYNCHRONIZATION , *ITERATIVE methods (Mathematics) , *NUMERICAL analysis , *ALGORITHMS - Abstract
Solving large sparse linear systems is essential in numerous scientific domains. Several algorithms, based on direct or iterative methods, have been developed for parallel architectures. On distributed grids consisting of processors located in distant geographical sites, their performance may be unsatisfactory because they suffer from too many synchronizations and communications. The GREMLINS code has been developed for solving large sparse linear systems on distributed grids. It implements the multisplitting method that consists in splitting the original linear system into several subsystems that can be solved independently. In this paper, the performance of the GREMLINS code obtained with several libraries for solving the linear subsystems is analyzed. Its performance is also compared with that of the widely used PETSc library that enables one to develop portable parallel applications. Numerical experiments have been carried out both on local clusters and on distributed grids. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
11. Adaptive wavelet methods and sparsity reconstruction for inverse heat conduction problems.
- Author
-
Bonesky, Thomas, Dahlke, Stephan, Maass, Peter, and Raasch, Thorsten
- Subjects
- *
HEAT conduction , *NUMERICAL analysis , *INVERSE problems , *WAVELETS (Mathematics) , *RECONSTRUCTION (Graph theory) , *ITERATIVE methods (Mathematics) , *IRON ores , *ALGORITHMS , *NUMERICAL solutions to partial differential equations - Abstract
This paper is concerned with the numerical treatment of inverse heat conduction problems. In particular, we combine recent results on the regularization of ill-posed problems by iterated soft shrinkage with adaptive wavelet algorithms for the forward problem. The analysis is applied to an inverse parabolic problem that stems from the industrial process of melting iron ore in a steel furnace. Some numerical experiments that confirm the applicability of our approach are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
12. Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation $${AX+BY=E\overline{X}F+S}$$.
- Author
-
Ai-GuoWu, Guang-Ren Duan, Yan-Ming Fu, and Wei-Jun Wu
- Subjects
- *
MATRICES (Mathematics) , *EQUATIONS , *NUMERICAL analysis , *ALGORITHMS , *ITERATIVE methods (Mathematics) - Abstract
This paper investigates the generalized Sylvester-conjugate matrix equation, which includes the normal Sylvester-conjugate, Kalman–Yakubovich-conjugate and generalized Sylvester matrix equations as its special cases. An iterative algorithm is presented for solving such a kind of matrix equations. This iterative method can give an exact solution within finite iteration steps for any initial values in the absence of round-off errors. Another feature of the proposed algorithm is that it is implemented by original coefficient matrices. By specifying the proposed algorithm, iterative algorithms for some special matrix equations are also developed. Two numerical examples are given to illustrate the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
13. Multi-phase dynamic constraint aggregation for set partitioning type problems.
- Author
-
Elhallaoui, Issmail, Metrane, Abdelmoutalib, Soumis, François, and Desaulniers, Guy
- Subjects
- *
ITERATIVE methods (Mathematics) , *NUMERICAL analysis , *MATHEMATICAL programming , *MATHEMATICS , *ALGORITHMS , *AGGREGATION operators - Abstract
Dynamic constraint aggregation is an iterative method that was recently introduced to speed up the linear relaxation solution process of set partitioning type problems. This speed up is mostly due to the use, at each iteration, of an aggregated problem defined by aggregating disjoint subsets of constraints from the set partitioning model. This aggregation is updated when needed to ensure the exactness of the overall approach. In this paper, we propose a new version of this method, called the multi-phase dynamic constraint aggregation method, which essentially adds to the original method a partial pricing strategy that involves multiple phases. This strategy helps keeping the size of the aggregated problem as small as possible, yielding a faster average computation time per iteration and fewer iterations. We also establish theoretical results that provide some insights explaining the success of the proposed method. Tests on the linear relaxation of simultaneous bus and driver scheduling problems involving up to 2,000 set partitioning constraints show that the partial pricing strategy speeds up the original method by an average factor of 4.5. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
14. Analytical and numerical evaluation of the suppressed fuzzy c-means algorithm: a study on the competition in c-means clustering models.
- Author
-
Sándor Szilágyi and Zoltán Benyó
- Subjects
- *
FUZZY sets , *ALGORITHMS , *CLUSTER analysis (Statistics) , *MATHEMATICAL models , *ITERATIVE methods (Mathematics) , *NUMERICAL analysis - Abstract
Abstract Suppressed fuzzy c-means (s-FCM) clustering was introduced in Fan et al. (Pattern Recogn Lett 24:1607–1612, 2003) with the intention of combining the higher speed of hard c-means (HCM) clustering with the better classification properties of fuzzy c-means (FCM) algorithm. The authors modified the FCM iteration to create a competition among clusters: lower degrees of memberships were diminished according to a previously set suppression rate, while the largest fuzzy membership grew by swallowing all the suppressed parts of the small ones. Suppressing the FCM algorithm was found successful in the terms of accuracy and working time, but the authors failed to answer a series of important questions. In this paper, we clarify the view upon the optimality and the competitive behavior of s-FCM via analytical computations and numerical analysis. A quasi competitive learning rate (QLR) is introduced first, in order to quantify the effect of suppression. As the investigation of s-FCM’s optimality did not provide a precise result, an alternative, optimally suppressed FCM (Os-FCM) algorithm is proposed as a hybridization of FCM and HCM. Both the suppressed and optimally suppressed FCM algorithms underwent the same analytical and numerical evaluations, their properties were analyzed using the QLR. We found the newly introduced Os-FCM algorithm quicker than s-FCM at any nontrivial suppression level. Os-FCM should also be favored because of its guaranteed optimality. [ABSTRACT FROM AUTHOR]
- Published
- 2010
15. Iterative Method for Solving the Linear Feasibility Problem.
- Author
-
Dudek, R.
- Subjects
- *
ITERATIVE methods (Mathematics) , *MATHEMATICAL inequalities , *PROBLEM solving , *NUMERICAL analysis , *FEASIBILITY studies , *APPROXIMATION theory , *EQUATIONS , *ALGORITHMS , *FUNCTIONAL analysis - Abstract
Many optimization problems reduce to the solution of a system of linear inequalities (SLI). Some solution methods use relaxed, averaged projections. Others invoke surrogate constraints (typically stemming from aggregation). This paper proposes a blend of these two approaches. A novelty comes from introducing as surrogate constraint a halfspace defined by differences of algorithmic iterates. The first iteration is identical to surrogate constraints methods. In next iterations, for a given approximation x¯, besides the violated constraints in x¯, we also take into consideration the surrogate inequality, which we have obtained in the previous iteration. The motivation for this research comes from the recent work of Scolnik et al. (Appl. Numer. Math. 41, 499—513, 2002), who studied some projection methods for a system of linear equations. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
16. Control of observations over random processes fluxes.
- Author
-
Boldyrikhin, N. and Khutortsev, V.
- Subjects
- *
STOCHASTIC processes , *ITERATIVE methods (Mathematics) , *ALGORITHMS , *NUMERICAL analysis , *PROBABILITY theory - Abstract
The construction of the iteration procedure for synthesizing the law of control of observation over the processes, appeared one after another according to random flux regularities, is considered. The general approach to solution of the problem and the approximate algorithm for synthesizing the law of observations control are given for the case of a simple Poissonian flux. The example is presented in the paper. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
17. Parametric Method for Global Optimization1,2.
- Author
-
MARCHI, S. DE and RAYKOV, I.
- Subjects
- *
MATHEMATICAL optimization , *HILBERT space , *LIPSCHITZ spaces , *ALGORITHMS , *ITERATIVE methods (Mathematics) , *BANACH spaces , *HYPERSPACE , *FUNCTION spaces , *NUMERICAL analysis - Abstract
This paper considers constrained and unconstrained parametric global optimization problems in a real Hilbert space. We assume that the gradient of the cost functional is Lipschitz continuous but not smooth. A suitable choice of parameters implies the linear or superlinear (supergeometric) convergence of the iterative method. From the numerical experiments, we conclude that our algorithm is faster than other existing algorithms for continuous but nonsmooth problems, when applied to unconstrained global optimization problems. However, because we solve 2n + 1 subproblems for a large number n of independent variables, our algorithm is somewhat slower than other algorithms, when applied to constrained global optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
18. A numerical procedure for multiple circular holes and elastic inclusions in a finite domain with a circular boundary.
- Author
-
Wang, J., Mogilevskaya, S. G., and Crouch, S. L.
- Subjects
- *
ELECTROSTATICS , *BOUNDARY element methods , *NUMERICAL analysis , *APPROXIMATION theory , *ALGORITHMS , *ITERATIVE methods (Mathematics) - Abstract
This paper describes a numerical procedure for solving two-dimensional elastostatics problems with multiple circular holes and elastic inclusions in a finite domain with a circular boundary. The inclusions may have arbitrary elastic properties, different from those of the matrix, and the holes may be traction free or loaded with uniform normal pressure. The loading can be applied on all or part of the finite external boundary. Complex potentials are expressed in the form of integrals of the tractions and displacements on the boundaries. The unknown boundary tractions and displacements are approximated by truncated complex Fourier series. A linear algebraic system is obtained by using Taylor series expansion without boundary discretization. The matrix of the linear system has diagonal submatrices on its diagonal, which allows the system to be effectively solved by using a block Gauss-Seidel iterative algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2003
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.