In this paper, a new identification of the Lagrange multipliers by means of the Sumudu transform, is employed to  btain a quick and accurate solution to the fractional Black-Scholes equation with the initial condition for a European option pricing problem. Undoubtedly this model is the most well known model for pricing financial derivatives. The fractional derivatives is described in Caputo sen...

Abstract This work focuses on the development of a super-penalty strategy based $$L^2$$ L 2 -projection suitable coupling terms to achieve $$C^1$$ C 1 -continuity between non-conforming multi-patch isogeometric Kirchhoff plates. In part...

In this paper, we present a new global-search method for designing QMF (quadrature-mirrorlter) lter banks. We formulate the design problem as a nonlinear constrained optimization problem, using the reconstruction error as the objective, and the other performance metrics as constraints. This formulation allows us to search for designs that improve over the best existing designs. Due to the nonli...

This paper introduces a genetic algorithm enhanced with a trap escaping strategy derived from the dual information presented as discrete Lagrange multipliers. When the genetic algorithm is trapped into a local optima, the Discrete Lagrange Multiplier method is called for the best individual found. The information provided by the Lagrangian method is unified, in the form of recombination, with t...

Interference and collisions greatly limit the throughput of mesh networks that used contention-based MAC protocols such as 802.11. Significantly higher throughput is achievable if transmissions are scheduled. However, traditional methods to compute optimal schedules are computationally intractable (unless co-channel interference is neglected). This paper presents a tractable technique to comput...

In this paper, we give a comparison between some notions of weak sharp minima introduced in [5,15,43] for set-valued optimization problems. Besides, establish Lagrange multiplier rules general constrained problems involving new scalarization functionals based on the oriented distance. Moreover, provide sufficient optimality conditions considered without any convexity assumptions.

In this work we present new weak conditions that ensure the validity of necessary second order optimality conditions (SOC) for nonlinear optimization. We are able to prove that weak and strong SOCs hold for all Lagrange multipliers using Abadie-type assumptions. We also prove weak and strong SOCs for at least one Lagrange multiplier imposing the Mangasarian-Fromovitz constraint qualification an...

The paper analyzes dynamic problems of stochastic optimization in discrete time. The problems under consideration are concerned with maximizing concave functionals on convex sets of feasible strategies (programs). Feasibility is defined in terms of linear inequality constraints in L∞ holding almost surely. The focus of the work is the existence of dual variables – stochastic Lagrange multiplier...