• Korean Journal of Mathematics
• /
• v.25 no.1
• /
• pp.37-43
• /
• 2017

We study the existence of positive solutions of second order nonlinear separated boundary value problems of superlinear as well as sublinear type without imposing monotonicity restrictions on the problem. The type of problem investigated cannot be analyzed using the linearization about the trivial solution because either it does not exist (the sublinear case) or is trivial (the superlinear case). The results follow from a known fixed point theorem by noticing that the concavity of the solutions provides an important condition for the applicability of the fixed point result.

• Journal of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.247-255
• /
• 1997

In this paper, we are concerned with the existence of positive solutions for the boundary value problems of the form; $$(1) u"(t) + q(t)g(u(t)) = 0, 0 < t < 1 $$ $$ u(0) = 0 = u(1), $$ where q is singular at 0 and /or 1.or 1.

• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.823-824
• /
• 2018

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.401-418
• /
• 2005

In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of unconstrained minimizers of the smoothing function with changing parameter t, converges with Q-superlinear rate to a Kuhn-Thcker point locally under some mild conditions. The relationship between the condition number of the Hessian matrix of the smoothing function and the parameter is studied, which also validates the convergence theory. Finally the numerical results are reported to show the effectiveness of this algorithm.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.759-772
• /
• 2012

In this paper, semi-infinite constrained programming, a class of constrained nonsmooth optimization problems, are transformed into unconstrained nonsmooth convex programs under the help of exact penalty function. The unconstrained objective function which owns the primal-dual gradient structure has connection with $\mathcal{VU}$-space decomposition. Then a $\mathcal{VU}$-space decomposition method can be applied for solving this unconstrained programs. Finally, the superlinear convergence algorithm is proved under certain assumption.

• Kyungpook Mathematical Journal
• /
• v.47 no.4
• /
• pp.569-578
• /
• 2007

Sufficient conditions for the existence of at least one solution of boundary value problems for higher order nonlinear difference equations are established. We allow $f$ to be at most linear, superlinear or sublinear in obtained results.

• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.33-41
• /
• 2022

In this paper, we study singular Dirichlet boundary value problems involving ϕ-Laplacian. Using fixed point index theory, the existence of positive solutions is established under the assumption that the nonlinearity f = f(u) has a positive falling zero and is either superlinear or sublinear at u = 0.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.165-177
• /
• 2005

In this paper, an adaptive trust region method based on the conic model for unconstrained optimization problems is proposed and analyzed. We establish the global and super linear convergence results of the method. Numerical tests are reported that confirm the efficiency of the new method.

• Journal of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.43-65
• /
• 2015

We present a new convergence analysis of popular Broyden's method in the Banach/Hilbert space setting which is applicable to non-smooth operators. Moreover, we do not assume a priori solvability of the equation under consideration. Nevertheless, without these simplifying assumptions our convergence theorem implies existence of a solution and superlinear convergence of Broyden's iterations. To demonstrate practical merits of Broyden's method, we use it for numerical solution of three nontrivial infinite-dimensional problems.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1511-1523
• /
• 2011

In this paper, we consider the smoothing Newton method for the nonlinear complementarity problems with $P_0$-function. The proposed algorithm is based on a new smoothing function and it needs only to solve one linear system of equations and perform one line search per iteration. Under the condition that the solution set is nonempty and bounded, the proposed algorithm is proved to be convergent globally. Furthermore, the local superlinearly(quadratic) convergence is established under suitable conditions. Preliminary numerical results show that the proposed algorithm is very promising.