• Nonlinear Functional Analysis and Applications
• /
• 제26권5호
• /
• pp.1077-1089
• /
• 2021

In this article, we introduce the quasi strongly E-convex function and pseudo strongly E-convex function on strongly E-convex set which generalizes strongly E-convex function defined by Youness [10]. Some non trivial examples have been constructed that show the existence of these functions. Several interesting properties of these functions have been discussed. An important characterization and relationship of these functions have been established. Furthermore, a nonlinear programming problem for quasi strongly E-convex function has been discussed.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.91-104
• /
• 2004

A modification of the gradient method of convex programming is introduced. Also, we describe symbolic implementation of the gradient method and its modification by means of the programming language MATHEMATICA. A few numerical examples are reported.

• Journal of applied mathematics & informatics
• /
• 제6권1호
• /
• pp.79-88
• /
• 1999

This work aims to establish an algorithm for solving the problem of convex programming with several objective-functions with linear constraints. Starting from the idea of Rosen's algorithm for solving the problem of convex programming with linear con-straints and taking into account the solution concept from multi-dimensional programming represented by a program which reaches "the best compromise" we are extending this method in the case of multidimensional programming. The concept of direction of min-imization is introduced and a necessary and sufficient condition is given for a s∈Rn direction to be a direction is min-imal. The two numerical examples presented at the end validate the algorithm.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.379-390
• /
• 2005

In this paper, optimality conditions for multiobjective programming problems having F-convex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function. Furthermore, an F-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of a saddle point are given.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.261-275
• /
• 2003

In this paper we study two stage problems of stochastic convex programming. Solving the problems is very hard. A L-shaped method for it is given. The implement of the algorithm is simple, so less computation work is needed. The result of computation shows that the algorithm is effective.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.567-579
• /
• 2009

Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$). In this paper we use this search direction to propose a primal-dual interior-point method for convex quadratic programming (QP). We overcome the difficulty in analyzing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$) for convex quadratic programming.

• 전기학회논문지
• /
• 제68권1호
• /
• pp.159-166
• /
• 2019

Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.

• Structural Engineering and Mechanics
• /
• 제23권4호
• /
• pp.431-447
• /
• 2006

A new incremental finite element model is developed to simulate the frictional contact of elastic bodies. The incremental convex programming method is exploited, in the framework of finite element approach, to recast the variational inequality principle of contact problem in a discretized form. The non-classical friction model of Oden and Pires is adopted, however, the friction effect is represented by an equivalent non-linear stiffness rather than additional constraints. Different parametric studies are worked out to address the versatility of the proposed model.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.227-235
• /
• 2004

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권9호
• /
• pp.1167-1174
• /
• 1999

In this paper, we present a new technique for the local decomposition of convex structuring elements for morphological image processing. Local decomposition of a structuring element consists of local structuring elements, in which each structuring element consists of a subset of origin pixel and its eight neighbors. Generally, local decomposition of a structuring element reduces the amount of computation required for morphological operations with the structuring element. A unique feature of our approach is the use of linear integer programming technique to determine optimal local decomposition that guarantees the minimal amount of computation. We defined a digital convex polygon, which, in turn, is defined as a convex structuring element, and formulated the necessary and sufficient conditions to decompose a digital convex polygon into a set of basis digital convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon, and those of the basis convex polygons. Further. a cost function was used represent the total processing time required for computation of dilation/erosion with the structuring elements in a decomposition. Then integer linear programming was used to seek an optimal local decomposition, that satisfies the linear equations and simultaneously minimize the cost function.