Search results for "Pie"

showing 10 items of 4404 documents

PAINT–SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization

2014

We introduce a novel approximation method for multiobjective optimization problems called PAINT–SiCon. The method can construct consistent parametric representations of Pareto sets, especially for nonconvex problems, by interpolating between nondominated solutions of a given sampling both in the decision and objective space. The proposed method is especially advantageous in computationally expensive cases, since the parametric representation of the Pareto set can be used as an inexpensive surrogate for the original problem during the decision making process. peerReviewed

Mathematical optimizationControl and OptimizationApplied MathematicsMathematicsofComputing_NUMERICALANALYSISPareto principleSampling (statistics)Management Science and Operations ResearchSpace (mathematics)Multi-objective optimizationComputer Science ApplicationsNonlinear programmingSet (abstract data type)piecewise linear approximationmultiple criteria programmingnonlinear programmingRepresentation (mathematics)Parametric statisticsMathematicsJournal of Global Optimization
researchProduct

Solving the discrete multiple criteria problem using linear prospect theory

1994

Abstract Prospect theory developed by Kahneman and Tversky is a popular model of choice in decision problems under uncertainty. Prospect theory has recently been extended to multiple criteria choice problems. In this paper, an interactive method for solving discrete multiple criteria decision problems, based on prospect theory type value functions, has been developed. Piecewise linear marginal value functions are assumed to approximate the S-shaped value functions of prospect theory. Therefore, the proposed procedure is valid only for convex preferences.

Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceDecision theoryConvex preferencesMarginal valueManagement Science and Operations ResearchType (model theory)Decision problemIndustrial and Manufacturing EngineeringPiecewise linear functionProspect theoryModeling and SimulationValue (economics)Mathematical economicsMathematicsEuropean Journal of Operational Research
researchProduct

Two-level Schwarz method for unilateral variational inequalities

1999

The numerical solution of variational inequalities of obstacle type associated with second-order elliptic operators is considered. Iterative methods based on the domain decomposition approach are proposed for discrete obstacle problems arising from the continuous, piecewise linear finite element approximation of the differential problem. A new variant of the Schwarz methodology, called the two-level Schwarz method, is developed offering the possibility of making use of fast linear solvers (e.g., linear multigrid and fictitious domain methods) for the genuinely nonlinear obstacle problems. Namely, by using particular monotonicity results, the computational domain can be partitioned into (mes…

Mathematical optimizationIterative methodApplied MathematicsGeneral MathematicsDomain decomposition methodsFinite element methodPiecewise linear functionComputational MathematicsMultigrid methodVariational inequalityAdditive Schwarz methodApplied mathematicsSchwarz alternating methodMathematicsIMA Journal of Numerical Analysis
researchProduct

Optimal placement of 3D sensors considering range and field of view

2017

This paper describes a novel approach to the problem of optimal placement of 3D sensors in a specified volume of interest. The coverage area of the sensors is modelled as a cone having limited field of view and range. The volume of interest is divided into many, smaller cubes each having a set of associated Boolean and continuous variables. The proposed method could be easily extended to handle the case where certain sub-volumes must be covered by several sensors (redundancy), for example ex-zones, regions where humans are not allowed to enter or regions where machine movement may obstruct the view of a single sensor. The optimisation problem is formulated as a Mixed-Integer Linear Program …

Mathematical optimizationLinear programming020207 software engineeringField of view02 engineering and technologySolverNonlinear systemRange (mathematics)0202 electrical engineering electronic engineering information engineeringRedundancy (engineering)Piecewise020201 artificial intelligence & image processingMATLABcomputerMathematicscomputer.programming_language2017 IEEE International Conference on Advanced Intelligent Mechatronics (AIM)
researchProduct

Subsignal-based denoising from piecewise linear or constant signal

2011

15 pages; International audience; n the present work, a novel signal denoising technique for piecewise constant or linear signals is presented termed as "signal split." The proposed method separates the sharp edges or transitions from the noise elements by splitting the signal into different parts. Unlike many noise removal techniques, the method works only in the nonorthogonal domain. The new method utilizes Stein unbiased risk estimate (SURE) to split the signal, Lipschitz exponents to identify noise elements, and a polynomial fitting approach for the sub signal reconstruction. At the final stage, merging of all parts yield in the fully denoised signal at a very low computational cost. St…

Mathematical optimization[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingComputer scienceStochastic resonanceNoise reduction[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing02 engineering and technology01 natural sciencesMultiplicative noisePiecewise linear function010104 statistics & probabilitySpeckle patternsymbols.namesakeSignal-to-noise ratioWavelet[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0202 electrical engineering electronic engineering information engineering0101 mathematicsSignal transfer functionShrinkageSignal reconstructionNoise (signal processing)General EngineeringNonlinear opticsWavelet transform020206 networking & telecommunicationsTotal variation denoisingAtomic and Molecular Physics and OpticsAdditive white Gaussian noiseGaussian noisePiecewisesymbolsStep detectionAlgorithm[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
researchProduct

Comparison of continuous and discontinuous Galerkin approaches for variable-viscosity Stokes flow

2015

We describe a Discontinuous Galerkin (DG) scheme for variable-viscosity Stokes flow which is a crucial aspect of many geophysical modelling applications and conduct numerical experiments with different elements comparing the DG approach to the standard Finite Element Method (FEM). We compare the divergence-conforming lowest-order Raviart-Thomas (RT0P0) and Brezzi-Douglas-Marini (BDM1P0) element in the DG scheme with the bilinear Q1P0 and biquadratic Q2P1 elements for velocity and their matching piecewise constant/linear elements for pressure in the standard continuous Galerkin (CG) scheme with respect to accuracy and memory usage in 2D benchmark setups. We find that for the chosen geodynami…

Mathematical optimizationbusiness.industryApplied MathematicsComputational MechanicsBilinear interpolationComputational fluid dynamicsStokes flow010502 geochemistry & geophysics01 natural sciencesFinite element method010101 applied mathematicsDiscontinuous Galerkin methodConvergence (routing)PiecewiseBenchmark (computing)Applied mathematics0101 mathematicsbusiness0105 earth and related environmental sciencesMathematicsZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik
researchProduct

Open and Discrete Maps with Piecewise Linear Branch Set Images are Piecewise Linear Maps

2018

The image of the branch set of a piecewise linear (PL)‐branched cover between PL 𝑛n‐manifolds is a simplicial (𝑛−2)(n−2)‐complex. We demonstrate that the reverse implication also holds: an open and discrete map 𝑓:𝕊𝑛→𝕊𝑛f:Sn→Sn with the image of the branch set contained in a simplicial (𝑛−2)(n−2)‐complex is equivalent up to homeomorphism to a PL‐branched cover. peerReviewed

Mathematics - Complex VariablesGeneral MathematicsImage (category theory)010102 general mathematicsGeometric Topology (math.GT)01 natural sciencesHomeomorphismPiecewise linear functionSet (abstract data type)CombinatoricsfunktioteoriaMathematics - Geometric TopologyCover (topology)0103 physical sciencesFOS: MathematicsHigh Energy Physics::Experiment010307 mathematical physicsComplex Variables (math.CV)0101 mathematicstopologiaMathematics
researchProduct

Sub-Finsler Geodesics on the Cartan Group

2018

This paper is a continuation of the work by the same authors on the Cartan group equipped with the sub-Finsler $\ell_\infty$ norm. We start by giving a detailed presentation of the structure of bang-bang extremal trajectories. Then we prove upper bounds on the number of switchings on bang-bang minimizers. We prove that any normal extremal is either bang-bang, or singular, or mixed. Consequently, we study mixed extremals. In particular, we prove that every two points can be connected by a piecewise smooth minimizer, and we give a uniform bound on the number of such pieces.

Mathematics - Differential Geometry0209 industrial biotechnologyPure mathematicsPhysics::General PhysicsGeodesic49K1549J1502 engineering and technology01 natural sciencesContinuationGeneral Relativity and Quantum CosmologyPhysics::Popular Physics020901 industrial engineering & automationMathematics (miscellaneous)Geometric controlFOS: Mathematics0101 mathematicsMathematics - Optimization and ControlMathematics010102 general mathematicsta111matemaattinen optimointiPhysics::History of Physics49J15; 49K15; Cartan group; geometric control; Sub-Finsler geometry; time-optimal control; Mathematics (miscellaneous)säätöteoriaDifferential Geometry (math.DG)Optimization and Control (math.OC)geometric controlNorm (mathematics)Piecewisetime-optimal controldifferentiaaliyhtälötSub-Finsler geometryCartan groupRegular and Chaotic Dynamics
researchProduct

Geodesic ray transform with matrix weights for piecewise constant functions

2019

We show injectivity of the geodesic X-ray transform on piecewise constant functions when the transform is weighted by a continuous matrix weight. The manifold is assumed to be compact and nontrapping of any dimension, and in dimension three and higher we assume a foliation condition. We make no assumption regarding conjugate points or differentiability of the weight. This extends recent results for unweighted transforms.

Mathematics - Differential Geometry44A12 65R32 53A99GeodesicGeneral Mathematics010102 general mathematicsMathematical analysisConjugate pointsmatrix weight01 natural sciencesinversio-ongelmatManifoldFoliation010101 applied mathematicsMatrix (mathematics)geodesic ray transformDifferential Geometry (math.DG)Dimension (vector space)FOS: MathematicsPiecewiseConstant function0101 mathematicsintegral geometryMathematics
researchProduct

Geodesic X-ray tomography for piecewise constant functions on nontrapping manifolds

2017

We show that on a two-dimensional compact nontrapping manifold with strictly convex boundary, a piecewise constant function is determined by its integrals over geodesics. In higher dimensions, we obtain a similar result if the manifold satisfies a foliation condition. These theorems are based on iterating a local uniqueness result. Our proofs are elementary.

Mathematics - Differential GeometryGeodesicinverse problemsGeneral Mathematics010102 general mathematicsGeodesic mapMathematical analysisBoundary (topology)16. Peace & justice01 natural sciencesManifoldFoliationinversio-ongelmatDifferential Geometry (math.DG)0103 physical sciencesPiecewiseFOS: Mathematics010307 mathematical physicsConstant functionMathematics::Differential Geometry0101 mathematicsConvex functionMathematics::Symplectic GeometryMathematics
researchProduct