共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we propose a method based on deep neural networks to solve obstacle problems. By introducing penalty terms, we reformulate the obstacle problem as a minimization optimization problem and utilize a deep neural network to approximate its solution. The convergence analysis is established by decomposing the error into three parts: approximation error, statistical error and optimization error. The approximate error is bounded by the depth and width of the network, the statistical error is estimated by the number of samples, and the optimization error is reflected in the empirical loss term. Due to its unsupervised and meshless advantages, the proposed method has wide applicability. Numerical experiments illustrate the effectiveness and robustness of the proposed method and verify the theoretical proof. 相似文献
2.
We study a class of mixed-integer programs for solving linear programs with joint probabilistic constraints from random right-hand side vectors with finite distributions. We present greedy and dual heuristic algorithms that construct and solve a sequence of linear programs. We provide optimality gaps for our heuristic solutions via the linear programming relaxation of the extended mixed-integer formulation of Luedtke et al. (2010) [13] as well as via lower bounds produced by their cutting plane method. While we demonstrate through an extensive computational study the effectiveness and scalability of our heuristics, we also prove that the theoretical worst-case solution quality for these algorithms is arbitrarily far from optimal. Our computational study compares our heuristics against both the extended mixed-integer programming formulation and the cutting plane method of Luedtke et al. (2010) [13]. Our heuristics efficiently and consistently produce solutions with small optimality gaps, while for larger instances the extended formulation becomes intractable and the optimality gaps from the cutting plane method increase to over 5%. 相似文献
3.
4.
In an earlier paper, we proposed a modified fuzzy programming method to handle higher level multi-level decentralized programming problems (ML(D)PPs). Here we present a simple and practical method to solve the same. This method overcomes the subjectivity inherent in choosing the tolerance values and the membership functions. We consider a linear ML(D)PP and apply linear programming (LP) for the optimization of the system in a supervised search procedure, supervised by the higher level decision maker (DM). The higher level DM provides the preferred values of the decision variables under his control to enable the lower level DM to search for his optimum in a narrower feasible space. The basic idea is to reduce the feasible space of a decision variable at each level until a satisfactory point is sought at the last level. 相似文献
5.
Georg S. Weiss 《Inventiones Mathematicae》1999,138(1):23-50
This paper contains a new approach to regularity and singularity of the obstacle problem: by means of an epiperimetric inequality and a monotonicity formula an energy decay estimate is derived. As a consequence, the increase in the solution’s homogeneity when passing to a smaller ball can be estimated. This leads to uniqueness of blow-up limits and regularity in that order. Oblatum 20-IV-1998 & 12-II-1999 / Published online: 21 May 1999 相似文献
6.
This paper intended to offer an architecture of artificial neural networks (NNs) for finding approximate solution of a second kind linear Fredholm integral equations system. For this purpose, first we substitute the N-th truncation of the Taylor expansion for unknown functions in the origin system. By applying the suggested neural network for adjusting the real coefficients of given expansions in resulting system. The proposed NN is a two-layer feed-back neural network such that it can get a initial vector and then calculates it’s corresponding output vector. In continuance, a cost function is defined by using output vector and the target outputs. Consequently, the reported NN using a learning algorithm that based on the gradient descent method, will adjust the coefficients in given Taylor series. Eventually, we have showed this method in comparison with existing numerical methods such as trapezoidal quadrature rule provides solutions with good generalization and high accuracy. The proposed method is illustrated by several examples with computer simulations. 相似文献
7.
《Mathematical and Computer Modelling》1999,29(3):9-18
An artificial neural network is proposed in this paper for solving the linear complementarity problem. The new neural network is based on a reformulation of the linear complementarity problem into the unconstrained minimization problem. Our new neural network can be easily implemented on a circuit. On the theoretical aspect, we analyze the existence of the equilibrium points for our neural network. In addition, we prove that if the equilibrium point exists for the neural network, then any such equilibrium point is both asymptotically and bounded (Lagrange) stable for any initial state. Furthermore, linear programming and certain quadratical programming problems (not necessarily convex) can be also solved by the neural network. Simulation results on several problems including a nonconvex one are also reported. 相似文献
8.
Michael Krätzschmar 《Numerische Mathematik》1989,54(5):507-531
Summary In this paper, we shall be concerned with the solution of constrained convex minimization problems. The constrained convex minimization problems are proposed to be transformable into a convex-additively decomposed and almost separable form, e.g. by decomposition of the objective functional and the restrictions. Unconstrained dual problems are generated by using Fenchel-Rockafellar duality. This decomposition-dualization concept has the advantage that the conjugate functionals occuring in the derived dual problem are easily computable. Moreover, the minimum point of the primal constrained convex minimization problem can be obtained from any maximum point of the corresponding dual unconstrained concave problem via explicit return-formulas. In quadratic programming the decomposition-dualization approach considered here becomes applicable if the quadratic part of the objective functional is generated byH-matrices. Numerical tests for solving obstacle problems in 1 discretized by using piecewise quadratic finite elements and in 2 by using the five-point difference approximation are presented. 相似文献
9.
Song Wang 《Optimization Letters》2014,8(6):1799-1811
We propose a power penalty method for an obstacle problem arising from the discretization of an infinite-dimensional optimization problem involving differential operators in both its objective function and constraints. In this method we approximate the mixed nonlinear complementarity problem (NCP) arising from the KKT conditions of the discretized problem by a nonlinear penalty equation. We then show the solution to the penalty equation converges exponentially to that of the mixed NCP. Numerical results will be presented to demonstrate the theoretical convergence rates of the method. 相似文献
10.
In this paper a mathematical problem with linear flexible constraints is considered. In order to solve the problem an approach is proposed based on multiobjective linear programming. Indeed, allowing violations for the constraints, and using multiobjective linear programming to minimize these violations, a subset of solution set which has less violations, namely efficiently feasible set, is obtained. Then, the corresponding objective function is optimized over efficiently feasible set in order to obtain an optimal solution. An application of the proposed approach in pattern classification is introduced. 相似文献
11.
12.
《European Journal of Operational Research》1996,93(2):244-256
We propose and analyse a new class of neural network models for solving linear programming (LP) problems in real time. We introduce a novel energy function that transforms linear programming into a system of nonlinear differential equations. This system of differential equations can be solved on-line by a simplified low-cost analog neural network containing only one single artificial neuron with adaptive synaptic weights. The network architecture is suitable for currently available CMOS VLSI implementations. An important feature of the proposed neural network architecture is its flexibility and universality. The correctness and performance of the proposed neural network is illustrated by extensive computer simulation experiments. 相似文献
13.
C. Brezinski 《Journal of Computational and Applied Mathematics》2012,236(8):2063-2077
For the solution of full-rank ill-posed linear systems a new approach based on the Arnoldi algorithm is presented. Working with regularized systems, the method theoretically reconstructs the true solution by means of the computation of a suitable function of matrix. In this sense, the method can be referred to as an iterative refinement process. Numerical experiments arising from integral equations and interpolation theory are presented. Finally, the method is extended to work in connection with the standard Tikhonov regularization with the right-hand side contaminated by noise. 相似文献
14.
《Comptes Rendus Mathematique》2008,346(5-6):351-356
In this Note, we present and analyze a new method for approximating linear elasticity problems in dimension two or three. This approach directly provides approximate strains, i.e., without simultaneously approximating the displacements, in finite element spaces where the Saint Venant compatibility conditions are exactly satisfied in a weak form. To cite this article: P.G. Ciarlet, P. Ciarlet, Jr., C. R. Acad. Sci. Paris, Ser. I 346 (2008). 相似文献
15.
Airlines are going through very difficult times financially which has been triggered by fierce competition and current high fuel prices. To stay competitive, it is absolutely essential that they achieve high efficiency in the areas that have control over. Airlines start generating revenues while their aircraft are flying. Reducing aircraft turn-around times is an important goal with passenger boarding being a major metric. 相似文献
16.
We present a new exact approach for solving bi-objective integer linear programs. The new approach employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that the new approach has three desirable characteristics. (1) It solves less single-objective integer linear programs. (2) Its solution time is significantly smaller. (3) It is competitive with the two-stage algorithm proposed by Leitner et al. (2016). 相似文献
17.
We describe a way of generating a warm-start point for interior point methods in the context of stochastic programming. Our
approach exploits the structural information of the stochastic problem so that it can be seen as a structure-exploiting initial
point generator. We solve a small-scale version of the problem corresponding to a reduced event tree and use the solution
to generate an advanced starting point for the complete problem. The way we produce a reduced tree tries to capture the important
information in the scenario space while keeping the dimension of the corresponding (reduced) deterministic equivalent small.
We derive conditions which should be satisfied by the reduced tree to guarantee a successful warm-start of the complete problem.
The implementation within the HOPDM and OOPS interior point solvers shows remarkable advantages. 相似文献
18.
Numerical Algorithms - We propose an interior penalty method to solve a nonlinear obstacle problem arising from the discretization of an infinite-dimensional optimization problem. An interior... 相似文献
19.
The communication mix is a relevant decision issue for an organization that plans the advertising campaign for a fixed future event. It is assumed that the objectives of the organization are to minimize the cost of the advertising campaign and to drive the final demand as close as possible to a target value. Two different advertising channels are available: the first affects deterministically the consumers’ demand, whereas the second presents some stochastic aspects which are out of decision-maker’s control. Some recent mathematical developments on the stochastic linear quadratic control problem allow to formulate and solve some interesting instances of the problem. A comparative analysis of the efficiency of deterministic and stochastic controls is done and the optimal feedback policies are discussed. The trade-off between efficiency and risk of an advertising channel is essential to understand the features of the optimal solutions.This study was supported by MIUR and University of Padua. 相似文献
20.
This paper presents new results on delay-dependent stability and stabilization for linear systems with interval time-varying delays. Some less conservative delay-dependent criteria for determining the stability of the time-delay systems are obtained in this paper. Based on the stability conditions, we propose a new state transformation technology to facilitate controller designing efficiently and computationally. The method is also applicable to the existing stability conditions reported by now, while the existing technologies may fail to derive computational control procedures from the stability conditions. Finally, some numerical examples well illustrate the effectiveness of the proposed method. 相似文献