NUMERICAL METHODS FOR SOLVING PROBLEMS WITH CONTRAST STRUCTURES
Современные информационные технологии и IT-образование, 2018 In this paper, we investigate the features of the numerical solution of Cauchy problems for nonlinear differential equations with contrast structures (interior layers). Similar problems arise in the modeling of certain problems of hydrodynamics, chemical
Evgenii B. Kuznetsov +4 more
doaj +1 more source
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization [PDF]
, 2017 Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability.
A Borzì +45 more
core +2 more sources
Quasi-Newton Methods for Solving Nonlinear Programming Problems [PDF]
Computer Science Journal of Moldova, 1996 In the present paper the problem of constrained equality optimization is reduced to sequential solving a series of problems of quadratic programming. The Hessian of the Lagrangian is approximated by a sequence of symmetric positive definite matrices. The
V.Moraru
doaj
Two methods for solving electrostatic problems with azimuthal symmetry [PDF]
Revista Brasileira de Ensino de FísicaThe study of electrostatic phenomena is the gateway to the physics described by Classical Electrodynamics. In this paper, we discuss in detail two methods based on the Uniqueness Theorem for solving electrostatic problems with azimuthal symmetry.
T.E.P. Bueno, U. Camara da Silva
doaj +2 more sources
Fast algorithms for large scale generalized distance weighted discrimination [PDF]
, 2017 High dimension low sample size statistical analysis is important in a wide range of applications. In such situations, the highly appealing discrimination method, support vector machine, can be improved to alleviate data piling at the margin.
Lam, Xin Yee +3 more
core +3 more sources
Enhanced Robust Univariate Classification Methods for Solving Outliers and Overfitting Problems
Journal of ICT, 2023 The robustness of some classical univariate classifiers is hampered if the data are contaminated. Overfitting is another hiccup when the data sets are uncontaminated with a considerable sample size.
Friday Zinzendoff Okwonu +4 more
doaj +1 more source
Three-Step Projective Methods for Solving the Split Feasibility Problems
Mathematics, 2019 In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP.
Suthep Suantai +3 more
doaj +1 more source
Numerical Methods for Solving Linear Time Varying Quadratic Optimal Control Problems
Results in Control and Optimization, 2022 In this article, we discussed linear time varying optimal control problems with quadratic performance index, and approximated control variable, state variable and performance index. There are many different numerical processes for approximating of linear
Adane Akate Ayalew
doaj +1 more source
Distributed Interior-point Method for Loosely Coupled Problems
, 2013 In this paper, we put forth distributed algorithms for solving loosely coupled unconstrained and constrained optimization problems. Such problems are usually solved using algorithms that are based on a combination of decomposition and first order methods.
Andersen, Martin S. +2 more
core +1 more source
Methods for Solving Linear Programming Problems Using Modern Computer Technologies
Цифрова платформа: інформаційні технології в соціокультурній сфері, 2018 The purpose of the article is to improve the study of such software products, as systems of the automated engineering’s and economic calculations of Excel and MathCAD which are resulted the detailed decision of optimization task, as to one of major and ...
Iryna Ovcharuk, Volodymyr Ovcharuk
doaj +1 more source