Suchergebnisse - simplex-like algorithm

  1. 1

    Portfolio choice and optimal hedging with general risk functions: A simplex-like algorithm von Balbás, Alejandro, Balbás, Raquel, Mayoral, Silvia

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 16.01.2009
    Veröffentlicht in European journal of operational research (16.01.2009)
    “… The minimization of general risk functions is becoming more and more important in portfolio choice theory and optimal hedging. There are two major reasons …”
    Volltext
    Journal Article
  2. 2

    Simplex-like algorithms for linear semidefinite optimization von Zhadan, Vitaly

    Veröffentlicht: IEEE 01.05.2017
    “… The linear semidefinite programming problem is considered. The primal and dual simplex-like algorithms are proposed for its solution …”
    Volltext
    Tagungsbericht
  3. 3

    An extended algorithm for separated continuous linear programs von Pullan, Malcolm C.

    ISSN: 0025-5610, 1436-4646
    Veröffentlicht: Heidelberg Springer 01.12.2002
    Veröffentlicht in Mathematical programming (01.12.2002)
    “… Recent work on SCLP has produced a detailed duality theory, conditions under which an optimal solution exists with a finite number of breakpoints, a purification algorithm, as well as a convergent …”
    Volltext
    Journal Article
  4. 4

    A simplex-like algorithm for the relaxation labeling process von Zhuang, X., Haralick, R.M., Joo, H.

    ISSN: 0162-8828
    Veröffentlicht: Los Alamitos, CA IEEE 01.12.1989
    “… A simplex-like algorithm is developed for the relaxation labeling process. The algorithm is simple and has a fast convergence property which is summarized as a one-more-step theorem …”
    Volltext
    Journal Article
  5. 5

    A comprehensive simplex-like algorithm for network optimization and perturbation analysis von Arsham, H., Oblak, M.

    ISSN: 0233-1934, 1029-4945
    Veröffentlicht: Gordon and Breach Science Publishers 01.01.1995
    Veröffentlicht in Optimization (01.01.1995)
    “… (primal, dual, and other variations) for network models, these problems are usually treated by one of over 100 specialized algorithms …”
    Volltext
    Journal Article
  6. 6

    Simplex-Like Trajectories on Quasi-Polyhedral Sets von Anderson, Edward J, Goberna, Miguel A, Lopez, Marco A

    ISSN: 0364-765X, 1526-5471
    Veröffentlicht: Linthicum INFORMS 01.02.2001
    Veröffentlicht in Mathematics of operations research (01.02.2001)
    “… This paper presents a unified treatment of two new simplex-like methods for linear semi-infinite programming problems with quasi-polyhedral feasible sets …”
    Volltext
    Journal Article
  7. 7

    Simplex-like Methods for Spherical Enclosure of Points and Spheres - Applications and Algorithms von Pimentel Cavaleiro, Marta Sofia

    ISBN: 9798662403482
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2020
    “… Given a set of m points in the Euclidean space Rn, the problem of the minimum enclosing ball of points, "MB problem of points'' for short, seeks the …”
    Volltext
    Dissertation
  8. 8

    Simplex-like sequential methods for a class of generalized fractional programs von Cambini, Riccardo, Carosi, Laura, Martein, Laura, Valipour, Ezat

    ISSN: 1432-2994, 1432-5217
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2017
    “… ; the particular structure of the objective function allows to provide a simplex-like algorithm even when the objective function is not pseudoconcave. Computational results validate the nice performance of the proposed algorithm …”
    Volltext
    Journal Article
  9. 9

    A simplex like approach based on star sets for recognizing convex-QP adverse graphs von Cardoso, Domingos M., Luz, Carlos J.

    ISSN: 1382-6905, 1573-2886
    Veröffentlicht: New York Springer US 01.01.2016
    Veröffentlicht in Journal of combinatorial optimization (01.01.2016)
    “… A graph G with convex- Q P stability number (or simply a convex- Q P graph) is a graph for which the stability number is equal to the optimal value of a convex …”
    Volltext
    Journal Article
  10. 10

    DASSO: connections between the Dantzig selector and lasso von James, Gareth M., Radchenko, Peter, Lv, Jinchi

    ISSN: 1369-7412, 1467-9868
    Veröffentlicht: Oxford, UK Oxford, UK : Blackwell Publishing Ltd 2009
    “… DASSO efficiently constructs a piecewise linear path through a sequential simplex-like algorithm, which is remarkably similar to the least angle regression algorithm …”
    Volltext
    Journal Article
  11. 11

    Simplifications and speedups of the pseudoflow algorithm von Hochbaum, Dorit S., Orlin, James B.

    ISSN: 0028-3045, 1097-0037
    Veröffentlicht: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.01.2013
    Veröffentlicht in Networks (01.01.2013)
    “… The pseudoflow algorithm for solving the maximum flow and minimum cut problems was devised in Hochbaum (2008 …”
    Volltext
    Journal Article
  12. 12

    A note on solving multi-objective integer indefinite quadratic fractional programs von Kushwah, Prerna, Sharma, Vikas

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: New York Springer US 01.06.2020
    Veröffentlicht in Annals of operations research (01.06.2020)
    “… In this note we have discussed that a simplex like algorithm to solve a indefinite quadratic fractional programming problem proposed by Mekhilef et al. (Ann Oper Res, 2019. https://doi.org …”
    Volltext
    Journal Article
  13. 13

    Local-Mean Preserving Post-Processing Step for Non-Negativity Enforcement in PET Imaging: Application to 90Y-PET von Millardet, Mael, Moussaoui, Said, Mateus, Diana, Idier, Jerome, Carlier, Thomas

    ISSN: 0278-0062, 1558-254X, 1558-254X
    Veröffentlicht: New York IEEE 01.11.2020
    Veröffentlicht in IEEE transactions on medical imaging (01.11.2020)
    “… To overcome this problem, algorithms without the built-in non-negativity constraint may be used …”
    Volltext
    Journal Article
  14. 14

    A fast and efficient implementation of qualitatively constrained quantile smoothing splines von Ng, Pin, Maechler, Martin

    ISSN: 1471-082X, 1477-0342
    Veröffentlicht: B-42, Panchsheel Enclave, New Delhi SAGE Publications 01.12.2007
    Veröffentlicht in Statistical modelling (01.12.2007)
    “… In a previous implementation, the linear program involved was solved using a simplex-like algorithm for quantile smoothing splines …”
    Volltext
    Journal Article
  15. 15

    Market equilibrium under piecewise Leontief concave utilities von Garg, Jugal

    ISSN: 0304-3975, 1879-2294
    Veröffentlicht: Elsevier B.V 05.12.2017
    Veröffentlicht in Theoretical computer science (05.12.2017)
    “… Leontief is one of the most widely used and extensively studied function in economic modeling, for both production and preferences. However it lacks the …”
    Volltext
    Journal Article
  16. 16

    Efficient domination through eigenvalues von Cardoso, Domingos M., Lozin, Vadim V., Luz, Carlos J., Pacheco, Maria F.

    ISSN: 0166-218X, 1872-6771
    Veröffentlicht: Elsevier B.V 11.12.2016
    Veröffentlicht in Discrete Applied Mathematics (11.12.2016)
    “… The paper begins with a new characterization of (k,τ)-regular sets. Then, using this result as well as the theory of star complements, we derive a simplex-like …”
    Volltext
    Journal Article
  17. 17

    A decomposition-based multiobjective evolutionary algorithm with weights updated adaptively von Liu, Yuan, Hu, Yikun, Zhu, Ningbo, Li, Kenli, Zou, Juan, Li, Miqing

    ISSN: 0020-0255, 1872-6291
    Veröffentlicht: Elsevier Inc 01.09.2021
    Veröffentlicht in Information sciences (01.09.2021)
    “… •A new decomposition algorithm with weights updated adaptively is proposed.•The proposed algorithm is applied to solve various multiobjective optimization problems …”
    Volltext
    Journal Article
  18. 18

    Solving multi-objective integer indefinite quadratic fractional programs von Mekhilef, Amal, Moulaï, Mustapha, Drici, Wassila

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: New York Springer US 01.01.2021
    Veröffentlicht in Annals of operations research (01.01.2021)
    “… In this paper, we describe an exact algorithm for solving a multi-objective integer indefinite quadratic fractional maximization problem …”
    Volltext
    Journal Article
  19. 19

    A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses von Adlakha, V., Arsham, H.

    ISSN: 0895-7177, 1872-9479
    Veröffentlicht: Oxford Elsevier Ltd 01.06.1998
    Veröffentlicht in Mathematical and computer modelling (01.06.1998)
    “… ) formulation of MFP and develop a simplex-type algorithm to find a minflow. Unlike other simplex-like algorithms, the algorithm developed here starts with an incomplete Basic Variable Set (BVS …”
    Volltext
    Journal Article
  20. 20

    Reliability of the weight vector generation method of the multi-objective evolutionary algorithm and application von Gao, Shuzhi, Ren, Xuepeng, Zhang, Yimin, Tang, Haihong

    ISSN: 0743-7315, 1096-0848
    Veröffentlicht: Elsevier Inc 01.11.2022
    Veröffentlicht in Journal of parallel and distributed computing (01.11.2022)
    “… weight vector is too specialized for the simplex-like front surface, which results in poor performance on the front surface with irregularities …”
    Volltext
    Journal Article