Results 31 to 40 of about 1,522 (137)
The split equilibrium problem and its convergence algorithms
, 2012 The purpose of this paper is to introduce a split equilibrium problem (SEP) and find a solution of the equilibrium problem such that its image under a given bounded linear operator is a solution of another equilibrium problem.
Zhenhua He
semanticscholar +1 more source
A Variational Model for Data Fitting on Manifolds by Minimizing the Acceleration of a Bézier Curve
Frontiers in Applied Mathematics and Statistics, 2018 We derive a variational model to fit a composite Bézier curve to a set of data points on a Riemannian manifold. The resulting curve is obtained in such a way that its mean squared acceleration is minimal in addition to remaining close the data points. We
Ronny Bergmann +1 more
doaj +1 more source
General algorithm and sensitivity analysis for variational inequalities
International Journal of Stochastic Analysis, Volume 5, Issue 1, Page 29-41, 1992., 1991 The fixed point technique is used to prove the existence of a solution for a class of variational inequalities related to odd order boundary value problems, and to suggest a general algorithm. We also study the sensitivity analysis for these variational inequalities and complementarity problems using the projection technique.
Muhammad Aslam Noor
wiley +1 more source
Iterative methods for nonlinear quasi complementarity problems
International Journal of Mathematics and Mathematical Sciences, Volume 10, Issue 2, Page 339-344, 1987., 1986 In this paper, we consider and study an iterative algorithm for finding the approximate solution of the nonlinear quasi complementarity problem of finding u ϵ k(u) such that where m is a point‐to‐point mapping, T is a (nonlinear) continuous mapping from a real Hilbert space H into itself and k*(u) is the polar cone of the convex cone k(u) in H. We also
Muhammad Aslam Noor
wiley +1 more source
Nonsmooth spectral gradient methods for unconstrained optimization
EURO Journal on Computational Optimization, 2017 To solve nonsmooth unconstrained minimization problems, we combine the spectral choice of step length with two well-established subdifferential-type schemes: the gradient sampling method and the simplex gradient method.
Milagros Loreto +3 more
doaj +1 more source
An existence theorem for optimal control with nonstandard cost functionals
International Journal of Mathematics and Mathematical Sciences, Volume 10, Issue 3, Page 609-611, 1987., 1987 An existence theorem for optimal control is obtained for a general nonstandard cost functional of fractional type in this work. As an application of our result we can derive an existence theorem for optimal control given by M. B. Subrahamanyam for a cost functional, which is a ratio of two given integral cost functionals.
R. N. Mukherjee, Shiv Prasad
wiley +1 more source
Constraint interface preconditioning for topology optimization problems [PDF]
, 2015 The discretization of constrained nonlinear optimization problems arising in the field of topology optimization yields algebraic systems which are challenging to solve in practice, due to pathological ill-conditioning, strong nonlinearity and size.
Kocvara, Michal +2 more
core +2 more sources
A non‐Markovian queueing system with a variable number of channels
, 2003 International Journal of Stochastic Analysis, Volume 16, Issue 4, Page 375-395, 2003.
Hong-Tham T. Rosson +1 more
wiley +1 more source
On solving the plateau problem in parametric form
International Journal of Mathematics and Mathematical Sciences, Volume 6, Issue 2, Page 341-361, 1983., 1981 This paper presents a numerical method for finding the solution of Plateau′s problem in parametric form. Using the properties of minimal surfaces we succeded in transferring the problem of finding the minimal surface to a problem of minimizing a functional over a class of scalar functions.
Baruch cahlon +2 more
wiley +1 more source
Convergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods [PDF]
, 2012 We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience.
A. Cegielski +29 more
core +2 more sources