Solution to a class of convex programming problems via quasilinearization
نویسندگان
چکیده
منابع مشابه
Numerical solution of variational problems via Haar wavelet quasilinearization technique
In this paper, a numerical solution based on Haar wavelet quasilinearization (HWQ) is used for finding the solution of nonlinear Euler-Lagrange equations which arise from the problems in calculus of variations. Some examples of variational problems are given and outcomes compared with exact solutions to demonstrate the accuracy and efficiency of the method.
متن کاملUNIQUENESS OF SOLUTION FOR A CLASS OF STEFAN PROBLEMS
This paper deals with a theoretical mathematical analysis of one-dimensional solidification problem, in which kinetic undercooling is incorporated into the This temperature condition at the interface. A model problem with nonlinear kinetic law is considered. We prove a local result intimate for the uniqueness of solution of the corresponding free boundary problem.
متن کاملExistence of positive solution to a class of boundary value problems of fractional differential equations
This paper is devoted to the study of establishing sufficient conditions for existence and uniqueness of positive solution to a class of non-linear problems of fractional differential equations. The boundary conditions involved Riemann-Liouville fractional order derivative and integral. Further, the non-linear function $f$ contain fractional order derivative which produce extra complexity. Than...
متن کاملInverse parametric convex programming problems via convex liftings
The present paper introduces a procedure to recover an inverse parametric linear or quadratic programming problem from a given polyhedral partition over which a continuous piecewise affine function is defined. The solution to the resulting parametric linear problem is exactly the initial piecewise affine function over the given original parameter space partition. We provide sufficient condition...
متن کاملCharacterizations of solution sets of cone-constrained convex programming problems
In this paper, we consider a type of cone-constrained convex program in finitedimensional space, and are interested in characterization of the solution set of this convex program with the help of the Lagrange multiplier. We establish necessary conditions for a feasible point being an optimal solution. Moreover, some necessary conditions and sufficient conditions are established which simplifies...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1970
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90136-8