Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “problem”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 667 records · Page 37

The Balanced Billing Cycle Vehicle Routing Problem

Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. We discuss the performance of our procedure on a real-world data set.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Sign problem and Monte Carlo calculations beyond Lefschetz thimbles

We point out that Monte Carlo simulations of theories with severe sign problems can be profitably performed over manifolds in complex space different from the one with fixed imaginary part of the action (“Lefschetz thimble”). We describe a family of such manifolds that interpolate between the tangent space at one critical point (where the sign problem is milder compared to the real plane but in some cases still severe) and the union of relevant thimbles (where the sign problem is mild but a multimodal distribution function complicates the Monte Carlo sampling). As a result, we exemplify this approach using a simple 0+1 dimensional fermion model previously used on sign problem studies and show that it can solve the model for some parameter values where a solution using Lefschetz thimbles was elusive.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Solving the wrong hierarchy problem

Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z 2 -symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z 2 copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs mass by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. Lastly, we show this mechanism postdicts the top Yukawa to be within 1σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

L{sup {infinity}} Variational Problems with Running Costs and Constraints

Various approaches are used to derive the Aronsson-Euler equations for L{sup {infinity}} calculus of variations problems with constraints. The problems considered involve holonomic, nonholonomic, isoperimetric, and isosupremic constraints on the minimizer. In addition, we derive the Aronsson-Euler equation for the basic L{sup {infinity}} problem with a running cost and then consider properties of an absolute minimizer. Many open problems are introduced for further study.

97 MATHEMATICS AND COMPUTING↗

Kalman Duality Principle for a Class of Ill-Posed Minimax Control Problems with Linear Differential-Algebraic Constraints

In this paper we present Kalman duality principle for a class of linear Differential-Algebraic Equations (DAE) with arbitrary index and time-varying coefficients. We apply it to an ill-posed minimax control problem with DAE constraint and derive a corresponding dual control problem. It turns out that the dual problem is ill-posed as well and so classical optimality conditions are not applicable in the general case. We construct a minimizing sequence <##> } } u }&#x005E;<!-- ^ --> } &#x03B5;<!-- ?? --> $ /hat{u}{sub {/varepsilon}} $ u-hat {sub ε} </##> for the dual problem applying Tikhonov method. Finally we represent <##> } } u }&#x005E;<!-- ^ --> } &#x03B5;<!-- ?? --> $ /hat{u}{sub {/varepsilon}} $ u-hat {sub ε} </##> in the feedback form using Riccati equation on a subspace which corresponds to the differential part of the DAE.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scenario generation for stochastic optimization problems via the sparse grid method

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.

97 MATHEMATICS AND COMPUTING↗

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗

Modeling design and control problems involving neural network surrogates

Here, we consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence, and then characterize stationarity of such models. We then present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation: as a mixed-integer optimization problem and as a mathematical program with complementarity constraints. For the latter formulation we prove that stationarity at a point for this problem corresponds to stationarity of the embedded formulation. Each of these formulations may be solved with state-of-the-art optimization methods, and we show how to obtain good initial feasible solutions for these methods. We compare our formulations on three practical applications arising in the design and control of combustion engines, in the generation of adversarial attacks on classifier networks, and in the determination of optimal flows in an oil well network.

97 MATHEMATICS AND COMPUTING↗

Using Filter Methods to Guide Convergence for ADMM, with Applications to Nonnegative Matrix Factorization Problems

Nonconvex, nonlinear optimization problems arise naturally in parameter fitting and machine learning. While augmented Lagrangian methods have demonstrated robust convergence for classes of these problems, their convergence for block updates has been relatively unexplored outside of the context of the alternating direction method of multipliers (ADMM). ADMM has seen extensive use in these applications, but may exhibit uncertain convergence behavior in many practical nonconvex settings, and struggles with general nonlinear constraints. In contrast, filter methods have proved effective in enforcing convergence for sequential quadratic programming methods and interior point methods with feasibility criteria. We develop an ADMM-filter method for highly nonlinear and nonconvex problems. Here, we show convergence under mild assumptions for several types of coordinate descent schemes, and demonstrate our algorithm on nonnegative matrix factorization and completion problems in imaging and chemical spectrum analysis.

Nonconvex optimization↗

Analysis of Nonclassical Fracture Problems for Prestressed Bodies with Interacting Cracks

We consider two types of nonclassical fracture mechanisms, namely, the fracture of cracked bodies with initial (residual) stresses acting along the crack planes and the fracture of solids under compression along parallel cracks. To investigate nonaxisymmetric and axisymmetric problems for infinite solids containing two parallel coaxial cracks or a periodic set of coaxial parallel cracks, we use a combined analytic-numerical method within the framework of the three-dimensional linearized mechanics of solids. The analysis involves the representation of stresses and displacements in the linearized theory via harmonic potential functions. With the use of the integral Fourier–Hankel transformations, the problems are reduced to the solution of Fredholm integral equations of the second kind. This approach allows us to investigate problems in a unified general form for compressible and noncompressible homogeneous isotropic or transversely isotropic elastic bodies with an arbitrary structure of the elastic potential, and the material specification of the model is carried out only in the stage of numerical analysis of the resolving equations obtained in the general form. The effects of initial stresses on the stress intensity factors are analyzed for highly elastic materials and layered composites (modeled as transversely isotropic elastic bodies). The “resonance-like” effects are revealed when compressive initial stresses reach the values corresponding to the local loss of stability of the material in the vicinity of cracks, which, according to the indicated combined method, allows one to determine the critical (limiting) load parameters under the conditions of compression of the body along the cracks. The conclusions concerning the dependences of the stress intensity factors and critical (limiting) parameters of compression on the geometric parameters of the problems are formulated as well as concerning the dependences on physical and mechanical characteristics of the materials.

42 ENGINEERING↗

Optimal Control Problem for Two-Layer Elastic Body with Crack

We establish the unique solvability of the equilibrium problem for a two-layer body. One layer contains a crack, whereas the second one is glued along its edge to the first layer in such a way that to cover one of the crack ends. In the case, where the second layer is a rigid plate, we show that the problem with a rigid patch is the limit of problems with elastic patches as the rigidity parameter tends to infinity. We also study the optimal control problem with the exterior forces acting on both layers taken for the control function.

36 MATERIALS SCIENCE↗

On the Kernel of a Two-Point Problem for a Partial Differential Equation of the Second Order in Time

We study the problem for a homogeneous partial differential equation of the second order with respect to time with given homogeneous two-point conditions in this variable and, in general, of the infinite order in the other (space) variable. It is proved that the analyzed problem possesses solely the trivial solution if the characteristic determinant is not identically equal to zero. In the case where the set of zeros of the characteristic determinant of this problem is nonempty, we propose a method for the construction of nontrivial solutions of the problem.

97 MATHEMATICS AND COMPUTING↗

Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem

We propose a quantum branch-and-bound algorithm based on the general scheme of the branch-and-bound method and the quantum nested searching algorithm and examine its computational efficiency. We also compare this algorithm with a similar classical algorithm on the example of the travelling salesman problem. We show that in the vast majority of problems, the classical algorithm is quicker than the quantum algorithm due to greater adaptability. However, the operation time of the quantum algorithm is constant for all problem, whereas the classical algorithm runs very slowly for certain problems. In the worst case, the quantum branch-and-bound algorithm is proved to be several times more efficient than the classical algorithm.

97 MATHEMATICS AND COMPUTING↗

A modified homotopy method for solving the principal-agent bilevel programming problem

In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.

97 MATHEMATICS AND COMPUTING↗

Analysis of thermo-elastic problems using the improved element-free Galerkin method

The improved element-free Galerkin method (IEFG) is presented to deal with thermo-elastic problems. This mesh-free method is a combination between the element-free Galerkin method and the improved moving least-square approximation. It has not the Kronecker delta property, and the penalty method is used to impose the essential boundary conditions. In this paper, linear and stationary thermo-elasticity is treated. To solve the thermo-elastic problem, this latter is decoupled into two separate parts: first, the heat transfer problem is analyzed to reach the temperature field, which is used as input in the mechanical problem to calculate the displacement field and then the stress fields. Numerical examples with different boundary conditions are illustrated. The performance and the accuracy of the IEFG method are approved when obtained results are compared to finite-element results and analytical solution.

97 MATHEMATICS AND COMPUTING↗

Stability of solution mappings for parametric bilevel vector equilibrium problems

In this paper, we first revisit the parametric bilevel vector equilibrium problems in Hausdorff topological vector spaces. Then we study the stability conditions such as (Hausdorff) upper semicontinuity, (Hausdorff) lower semicontinuity, outer-continuity and outer-openness of solutions for such problems. Many examples are provided to illustrate the essentialness of the imposed assumptions. For the applications, we obtain the stability results for the parametric vector variational inequality problems with equilibrium constraints and parametric vector optimization problems with equilibrium constraints.

97 MATHEMATICS AND COMPUTING↗

A new accelerated algorithm for ill-conditioned ridge regression problems

In this work, we study the primal and dual formulations of the regularized least squares problem, in special norm L{sub 2}, named ridge regression. We state the Gradient method for the corresponding primal-dual problem through a fixed point approach. For this formulation, we present an original convergence analysis involving the spectral radius of a suitable iteration matrix. The main contribution of this work is to accelerate the studied method by means of a memory-like strategy. Some connections with the spectral properties of the associated iteration matrices were established to prove the convergence of the accelerated method. Preliminary experiments showed the good performance of the proposed algorithm when applied to solve ill-conditioned problems, providing better results than the conjugate gradient method for this class of problems.

97 MATHEMATICS AND COMPUTING↗

Similarity solution for a two-phase one-dimensional Stefan problem with a convective boundary condition and a mushy zone model

A two-phase solidification process for a one-dimensional semi-infinite material is considered. It is assumed that it is ensued from a constant bulk temperature present in the vicinity of the fixed boundary, which it is modelled through a convective condition (Robin condition). The interface between the two phases is idealized as a mushy region and it is represented following the model of Solomon, Wilson, and Alexiades. An exact similarity solution is obtained when a restriction on data is verified, and it is analysed the relation between the problem considered here and the problem with a temperature condition at the fixed boundary. Moreover, it is proved that the solution to the problem with the convective boundary condition converges to the solution to a problem with a temperature condition when the heat transfer coefficient at the fixed boundary goes to infinity, and it is given an estimation of the difference between these two solutions. Results in this article complete and improve the ones obtained in Tarzia (Comput Appl Math 9:201–211, 1990).

97 MATHEMATICS AND COMPUTING↗