A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-004-6455-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025836705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Descent from Local Minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of global methods in multiextremal optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimum potential energy conformations of small molecules / 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: Interval Methods for Systems of Equations / 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: Stochastic global optimization methods part I: Clustering methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic global optimization methods part II: Multi level methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic techniques for global optimization: A survey of recent advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a difference of two convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016509 / rank
 
Normal rank

Latest revision as of 13:02, 11 June 2024

scientific article
Language Label Description Also known as
English
A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
scientific article

    Statements

    A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (English)
    0 references
    16 November 2005
    0 references
    0 references
    \(\alpha\)BB
    0 references
    convex underestimators
    0 references
    global optimization
    0 references
    0 references