An adaptive parallel projection method for solving convex feasibility problems.
An Algorithm for Calculating One Subgradient of a Convex Function of Two Variables.
An Algorithm for Determining Redundant Inequalities and All Solutions to Convex Polyhedra.
An Algorithm for Discrete Linear Lp Approximation.
An Alternative Computational Method for the Approximation of Random Functions.
An alternative method for construction of optimal sequential questionnaires
An application of semi-infinite linear programming: approximation of a continuous function by a polynomial
An approach to robust network design in telecommunications
In telecommunications network design, one of the most frequent problems is to adjust the capacity on the links of the network in order to satisfy a set of requirements. In the past, these requirements were demands based on historical data and/or demographic predictions. Nowadays, because of new technology development and customer movement due to competitiveness, the demands present considerable variability. Thus, network robustness w.r.t demand uncertainty is now regarded as a major consideration....
An approximation scheme for the optimal control of diffusion processes
An Approximation Technique for the Numerical Solution of a Stefan Problem.
An approximative method for solving the non-linear optimal control problem
An asymptotical variational principle associated with the steepest descent method for a convex function.
An efficiency analysis of the parallel multitransputer implementation of two-level optimization algorithms
The paper presents an approach to improve the efficiency of some two-level optimization algorithms by their implementation in parallel MIMD multiprocessor systems. Diagonal decomposition dynamic programming and parametric optimization methods are considered, and some concepts of their parallelization are discussed. Results regarding the implementation of computations in a parallel multitransputer system are presented. For the analysed problems, the obtained values of speedup are close to the theoretical...
An Efficient Method for Calculating Smoothing Splines Using Orthogonal Transformations.
An entropic regularization method for solving systems of fuzzy linear inequalities.
An error estimation for the method of bisection in IR^n
An existence theorem for extended mildly nonlinear complementarity problem in semi-inner product spaces
We prove a result for the existence and uniqueness of the solution for a class of mildly nonlinear complementarity problem in a uniformly convex and strongly smooth Banach space equipped with a semi-inner product. We also get an extension of a nonlinear complementarity problem over an infinite dimensional space. Our last results deal with the existence of a solution of mildly nonlinear complementarity problem in a reflexive Banach space.
An hp-Discontinuous Galerkin Method for the Optimal Control Problem of Laser Surface Hardening of Steel
In this paper, we discuss an hp-discontinuous Galerkin finite element method (hp-DGFEM) for the laser surface hardening of steel, which is a constrained optimal control problem governed by a system of differential equations, consisting of an ordinary differential equation for austenite formation and a semi-linear parabolic differential equation for temperature evolution. The space discretization of the state variable is done using an hp-DGFEM, time and control discretizations are based on a discontinuous Galerkin...
An hp-Discontinuous Galerkin Method for the Optimal Control Problem of Laser Surface Hardening of Steel
In this paper, we discuss an hp-discontinuous Galerkin finite element method (hp-DGFEM) for the laser surface hardening of steel, which is a constrained optimal control problem governed by a system of differential equations, consisting of an ordinary differential equation for austenite formation and a semi-linear parabolic differential equation for temperature evolution. The space discretization of the state variable is done using an hp-DGFEM, time and control discretizations are based on a discontinuous Galerkin...
An imperfect conjugate gradient algorithm
A new biorthogonalization algorithm is defined which does not depend on the step-size used. The algorithm is suggested so as to minimize the total error after steps if imperfect steps are used. The majority of conjugate gradient algorithms are sensitive to the exactness of the line searches and this phenomenon may destroy the global efficiency of these algorithms.