Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(9 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-014-0772-4 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Global Optimization Toolbox For Maple / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PSwarm / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LGO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MCS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIRECT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-014-0772-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110446256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using DIRECT to solve an aircraft routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for noisy problems in gas transmission pipeline optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIRECT algorithm: A new definition of potentially optimal hyperrectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of global optimization methods for the design of a high-speed civil transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified DIviding RECTangles algorithm for a problem in astrophysics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic approach to global box-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for finding global extrema (Case of a non-uniform mesh) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization by multilevel coordinate search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive scaling and the \texttt{DIRECT} algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A locally-biased form of the DIRECT algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic data structures for a direct search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian optimization without the Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: A univariate global search working with a set of Lipschitz constants for the first derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz gradients for global optimization in a one-point-based partitioning scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partition-based global optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally-biased disimpl algorithm for expensive global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Lipschitz optimization without the Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-free optimization: a review of algorithms and comparison of software implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSwarm: a hybrid solver for linearly constrained global derivative-free optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-014-0772-4 / rank
 
Normal rank

Latest revision as of 12:33, 9 December 2024

scientific article; zbMATH DE number 6550150
Language Label Description Also known as
English
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
scientific article; zbMATH DE number 6550150

    Statements

    Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (English)
    0 references
    0 references
    0 references
    4 March 2016
    0 references
    global optimization
    0 references
    \texttt{DISIMPL} algorithm
    0 references
    \texttt{DIRECT} algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers