Results 11 to 20 of about 791,635 (286)
Approximation with interpolatory constraints [PDF]
Given a triangular array of points on [ − 1 , 1 ] [-1,1] satisfying certain minimal separation conditions, a classical theorem of Szabados asserts the existence of polynomial operators that provide interpolation at these points as well as a near-optimal degree of approximation for arbitrary ...
Mhaskar, H. N. +3 more
openaire +2 more sources
𝐿¹-approximation with constraints [PDF]
In this paper we study problems of best L 1 {L^1} -approximation to continuous functions from finite-dimensional subspaces under a variety of constraints. Included are problems of bounded coefficient approximation, approximation with interpolation, restricted range approximation, and restricted range
Allan Pinkus, Hans Strauss
openaire +1 more source
Many practical problems, such as computer science, communications network, product design, system control, statistics and finance, etc.,can be formulated as a probabilistic constrained optimization problem (PCOP) which is challenging to solve since it is
Yong H. Ren +3 more
doaj +1 more source
Non-Gaussian Pseudolinear Kalman Filtering-Based Target Motion Analysis with State Constraints
For the bearing-only target motion analysis (TMA), the pseudolinear Kalman filter (PLKF) solves the complex nonlinear estimation of the motion model parameters but suffers serious bias problems.
Ming Li +3 more
doaj +1 more source
Optimization of coal procurement and inventory for power generation enterprises are of great significance for guaranteeing power supply and ensuring generation income.
Li YAO +5 more
doaj +1 more source
Environmental demands around the world have led to an increasing interest in natural gas due to its advantages over other hydrocarbons used in power generation, which has led to the search for the best way to solve the transportation problem associated ...
Cristian Alejandro Blanco-Martínez +4 more
doaj +1 more source
Best approximation with geometric constraints
AbstractIn this paper, we consider a finite family of sets (geometric constraints) $$F_{1}, F_{2},\ldots , F_{r}$$ F 1 , F 2
Mohebi, Hossein, Bakhtiari, Hassan
openaire +1 more source
Improved Combinatorial Approximations for Weighted Correlation Clustering [PDF]
We present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity.
Mojtaba Ostovari, Alireza Zarei
doaj +1 more source
Consistency of Approximation of Bernstein Polynomial-Based Direct Methods for Optimal Control
Bernstein polynomial approximation of continuous function has a slower rate of convergence compared to other approximation methods. “The fact seems to have precluded any numerical application of Bernstein polynomials from having been made.
Venanzio Cichella +4 more
doaj +1 more source
As the core sub-problem of both network reconfiguration and service restoration of the electrical distribution system (EDS), the load pick-up (LPP) problem in EDS searches the optimal configuration of the EDS, aiming to minimise the power loss or provide
Jingyang Yun +6 more
doaj +1 more source

