On the public citation graph

A Collection of Test Problems for Constrained Global Optimization Algorithms

https://doi.org/10.1007/3-540-53032-0
0 signed · 480 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4668407openalex-extracted
Multi-Objective Optimization Algorithm Classification by Composing Black Box with Pareto-Reflecting Functions
inferred← citeshttps://doi.org/10.1002/1520-6750(199404)41:3<455::aid-nav3220410310>3.0.co;2-qopenalex-snapshot
A penalty for concave minimization derived from the tuy cutting plane
inferred← citeshttps://doi.org/10.1002/9781119993766.app1openalex-snapshot
Appendix A: Examples
inferred← citeshttps://doi.org/10.1002/aic.11228openalex-snapshot
A kriging method for the solution of nonlinear programs with black‐box functions
inferred← citeshttps://doi.org/10.1002/aic.14442openalex-snapshot
Derivative‐free optimization for expensive constrained problems using a novel expected improvement objective function
inferred← citeshttps://doi.org/10.1002/aic.15362openalex-snapshot
A novel feasibility analysis method for black‐box processes using a radial basis function adaptive sampling approach
inferred← citeshttps://doi.org/10.1002/int.v24:4openalex-snapshot
inferred← citeshttps://doi.org/10.1007/0-306-48041-7_10openalex-snapshot
Constrained Genetic Algorithms and Their Applications in Nonlinear Constrained Optimization
inferred← citeshttps://doi.org/10.1007/0-306-48041-7_4openalex-snapshot
Constrained Evolutionary Optimization
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_181openalex-snapshot
Global Optimization of Heat Exchanger Networks
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_282openalex-snapshot
Minimum Concave Transportation Problems
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_405openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_70openalex-snapshot
Continuous Global Optimization: Applications
inferred← citeshttps://doi.org/10.1007/0-387-23529-9_3openalex-snapshot
Generating Set Partitioning Test Problems with Known Optimal Integer Solutions
inferred← citeshttps://doi.org/10.1007/0-387-25570-2_5openalex-snapshot
On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology
inferred← citeshttps://doi.org/10.1007/1-4020-2267-0_23openalex-snapshot
Adaptive Penalty Strategies in Genetic Search for Problems with Inequality and Equality Constraints
inferred← citeshttps://doi.org/10.1007/11425076_5openalex-snapshot
A Method for Global Optimization of Large Systems of Quadratic Constraints
inferred← citeshttps://doi.org/10.1007/11538059_99openalex-snapshot
An Entropy-Based Multi-population Genetic Algorithm and Its Application
inferred← citeshttps://doi.org/10.1007/11539902_71openalex-snapshot
Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems
inferred← citeshttps://doi.org/10.1007/11893011_86openalex-snapshot
Evolutionary Elementary Cooperative Strategy for Global Optimization
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_31openalex-snapshot
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_235openalex-snapshot
Global Optimization of Heat Exchanger Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_372openalex-snapshot
Minimum Concave Transportation Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_534openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_88openalex-snapshot
Continuous Global Optimization: Applications
inferred← citeshttps://doi.org/10.1007/978-1-4471-0123-9_26openalex-snapshot
Multi-Constrained Nonlinear Optimization by the Differential Evolution Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4471-1589-2_13openalex-snapshot
Mapping Based Constraint Handling for Evolutionary Search; Thurston’s Circle Packing and Grid Generation
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_1openalex-snapshot
Distributed Branch and Bound Algorithms for Global Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4612-1960-6_7openalex-snapshot
Deterministic Global Optimization in Design, Control, and Computational Chemistry
inferred← citeshttps://doi.org/10.1007/978-1-4613-0215-5_15openalex-snapshot
The NOP-2 Modeling Language
inferred← citeshttps://doi.org/10.1007/978-1-4613-0279-7_31openalex-snapshot
Stochastic Perturbation Methods for Affine Restrictions
inferred← citeshttps://doi.org/10.1007/978-1-4613-0295-7_12openalex-snapshot
Two Approaches for Parallelizing the UEGO Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_12openalex-snapshot
Test Results for an Interval Branch and Bound Algorithm for Equality-Constrained Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_24openalex-snapshot
Nonconvex Global Optimization of the Separable Resource Allocation Problem with Continuous Variables
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_35openalex-snapshot
Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis
inferred← citeshttps://doi.org/10.1007/978-1-4613-3440-8_2openalex-snapshot
A Review of Techniques in the Verified Solution of Constrained Global Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-5131-0_16openalex-snapshot
A Collection of Test Multiextremal Optimal Control Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-6797-7_7openalex-snapshot
Applications in Chemical Engineering
inferred← citeshttps://doi.org/10.1007/978-1-4614-9056-2_4openalex-snapshot
Refined EM Method for Solving Linearly Constrained Global Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_14openalex-snapshot
Interval Methods
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_3openalex-snapshot
Concave Minimization: Theory, Applications and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-2600-8_1openalex-snapshot
NOP — A Compact Input Format for Nonlinear Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-2600-8_2openalex-snapshot
GLOPT — A Program for Constrained Global Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_28openalex-snapshot
Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_23openalex-snapshot
One way to Construct a Global Search Algorithm for d.c. Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-5284-7_10openalex-snapshot
Solving Global Optimization Problems with Baron
inferred← citeshttps://doi.org/10.1007/978-1-4757-5331-8_1openalex-snapshot
Branch and Bound for Global NLP: New Bounding LP
inferred← citeshttps://doi.org/10.1007/978-1-4757-5331-8_10openalex-snapshot
Alternative Bounding Approximations for the Global Optimization of Various Engineering Design Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-5331-8_3openalex-snapshot
New Formulations and Branching Strategies for the GOP Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-5331-8_4openalex-snapshot
Computational Results for an Efficient Implementation of the GOP Algorithm and Its Variants
inferred← citeshttps://doi.org/10.1007/978-1-4757-5331-8_6openalex-snapshot
Global Optimization of Nonconvex MINLP’s by Interval Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4757-5362-2_1openalex-snapshot
Tight Relaxations for Nonconvex Optimization Problems Using the Reformulation-Linearization/Convexification Technique (RLT)
inferred← citeshttps://doi.org/10.1007/978-1-4757-5362-2_15openalex-snapshot
Global Optimization: Software, Test Problems, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-10501-3_15openalex-snapshot
Optimized Packings in Space Engineering Applications: Part I
inferred← citeshttps://doi.org/10.1007/978-3-030-12819-7_6openalex-snapshot
Reliability-Based Design Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-23672-4_11openalex-snapshot
Nesterov Step Reduced Gradient Algorithm for Convex Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-26369-0_10openalex-snapshot
Parameters Optimization of Relay Self-oscillations Sampled Data Controller Based on Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_235-1openalex-snapshot
Global Optimization of Heat Exchanger Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_372-1openalex-snapshot
Minimum Concave Transportation Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_534-1openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-64541-0_2openalex-snapshot
Controller Tuning by Metaheuristics Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-41229-5_2openalex-snapshot
Employing the Cloud for Finding Solutions to Large Systems of Nonlinear Equations
inferred← citeshttps://doi.org/10.1007/978-3-031-44505-7_4openalex-snapshot
Fast and Robust Constrained Optimization via Evolutionary and Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-3-032-15455-2_15openalex-snapshot
An Efficient Method for Solving Large-Scale Multimodal Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-05005-8_1openalex-snapshot
Non-standard Packing Problems: A Modelling-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-16549-3_37openalex-snapshot
A Benchmark for Virtual Camera Control
inferred← citeshttps://doi.org/10.1007/978-3-319-26555-1_39openalex-snapshot
A Feature-Based Analysis on the Impact of Set of Constraints for $$\varepsilon $$ -Constrained Differential Evolution
inferred← citeshttps://doi.org/10.1007/978-3-319-46364-3_5openalex-snapshot
Constrained Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-58356-3_4openalex-snapshot
Applications of Continuous Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-69404-7_2openalex-snapshot
Test Problems for Parallel Algorithms of Constrained Global Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-69404-7_35openalex-snapshot
Emmental-Type GKLS-Based Multiextremal Smooth Test Problems with Non-linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-31880-4_15openalex-snapshot
Multi-objective Go with the Winners Algorithm: A Preliminary Study
inferred← citeshttps://doi.org/10.1007/978-3-540-39930-8_11openalex-snapshot
Applications in Fluid Mechanics
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_32openalex-snapshot
Operations Preserving Recognizable Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-72950-1_77openalex-snapshot
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-72960-0_1openalex-snapshot
Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-77465-5_1openalex-snapshot
Optimization of Industrial Processes Using Improved and Modified Differential Evolution
inferred← citeshttps://doi.org/10.1007/978-3-540-89694-4_34openalex-snapshot
Task Decomposition for Optimization Problem Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-02568-6_21openalex-snapshot
An Improved Particle Swarm Optimization with Feasibility-Based Rules for Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_2openalex-snapshot
Metaheuristic Optimization: Algorithm Analysis and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-23845-1_6openalex-snapshot
Modeling and Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-34459-6_22openalex-snapshot
An Ecology-Based Heterogeneous Approach for Cooperative Search
inferred← citeshttps://doi.org/10.1007/978-81-322-2012-1_14openalex-snapshot
Solving Nonlinear Constrained Optimization Problems Using Invasive Weed Optimization
inferred← citeshttps://doi.org/10.1007/978-81-322-2184-5_2openalex-snapshot
Ruggedness Quantifying for Constrained Continuous Fitness Landscapes
inferred← citeshttps://doi.org/10.1007/978-81-322-2184-5_3openalex-snapshot
Trust Regions in Surrogate-Assisted Evolutionary Programming for Constrained Expensive Black-Box Optimization
inferred← citeshttps://doi.org/10.1007/978-81-322-2220-0_49openalex-snapshot
Hybridizing Particle Swarm Optimization with Invasive Weed Optimization for Solving Nonlinear Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-94-009-0153-7_36openalex-snapshot
The Practical Application of a Dynamic Search-Trajectory Method for Constrained Global Optimization
inferred← citeshttps://doi.org/10.1007/978-981-10-6544-6_33openalex-snapshot
An Optimal Multi-view Ensemble Learning for High Dimensional Data Classification Using Constrained Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1007/978-981-13-1135-2_36openalex-snapshot
Butterfly Constrained Optimizer for Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-981-13-2826-8_31openalex-snapshot
Adaptive Recombination Operator Selection in Push and Pull Search for Solving Constrained Single-Objective Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-981-13-6733-5_34openalex-snapshot
A New Method for the Minimum Concave Cost Transportation Problem in Smart Transportation
inferred← citeshttps://doi.org/10.1007/978-981-13-6733-5_38openalex-snapshot
Decentralized Differential Evolutionary Algorithm for Large-Scale Networked Systems
inferred← citeshttps://doi.org/10.1007/978-981-95-5657-1_3openalex-snapshot
Utilizing Large Language Models for Finding All Roots to Nonlinear Systems of Equations: Solutions, Accuracy, and Prompt Design
inferred← citeshttps://doi.org/10.1007/978-981-97-6769-4_6openalex-snapshot
On the Inexact Proximal Gauss–Newton Methods for Regularized Nonlinear Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-981-99-1176-9_11openalex-snapshot
Optimization Problem Solutions
inferred← citeshttps://doi.org/10.1007/bf00121267openalex-snapshot
Test problem construction for linear bilevel programming problems
inferred← citeshttps://doi.org/10.1007/bf00121301openalex-snapshot
Reduction of indefinite quadratic programs to bilinear programs
inferred← citeshttps://doi.org/10.1007/bf00121661openalex-snapshot
Computational experience using an edge search algorithm for linear reverse convex programs
inferred← citeshttps://doi.org/10.1007/bf00121749openalex-snapshot
Rigorous convex underestimators for general twice-differentiable problems
inferred← citeshttps://doi.org/10.1007/bf00138689openalex-snapshot
A branch-and-reduce approach to global optimization
inferred← citeshttps://doi.org/10.1007/bf00171828openalex-snapshot
A parallel stochastic method for solving linearly constrained concave global minimization problems
inferred← citeshttps://doi.org/10.1007/bf00171829openalex-snapshot
An interval branch and bound algorithm for bound constrained optimization problems
inferred← citeshttps://doi.org/10.1007/bf00175358openalex-snapshot
Non-standard methods in evolutionary computation
inferred← citeshttps://doi.org/10.1007/bf00253805openalex-snapshot
Generating quadratic assignment test problems with known optimal permutations
inferred← citeshttps://doi.org/10.1007/bf00939667openalex-snapshot
Primal-relaxed dual global optimization approach
inferred← citeshttps://doi.org/10.1007/bf00995497openalex-snapshot
On global optimization in two-dimensional scaling
inferred← citeshttps://doi.org/10.1007/bf01096414openalex-snapshot
New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
inferred← citeshttps://doi.org/10.1007/bf01096682openalex-snapshot
Computational comparison of two methods for constrained global optimization
inferred← citeshttps://doi.org/10.1007/bf01096688openalex-snapshot
On the construction of test problems for concave minimization algorithms
inferred← citeshttps://doi.org/10.1007/bf01096734openalex-snapshot
A wide class of test functions for global optimization
inferred← citeshttps://doi.org/10.1007/bf01097001openalex-snapshot
A generalization of the construction of test problems for nonconvex optimization
inferred← citeshttps://doi.org/10.1007/bf01099263openalex-snapshot
Application of Bayesian approach to numerical methods of global and stochastic optimization
inferred← citeshttps://doi.org/10.1007/bf01100203openalex-snapshot
A reformulation-convexification approach for solving nonconvex quadratic programming problems
inferred← citeshttps://doi.org/10.1007/bf01100693openalex-snapshot
A class of test functions for global optimization
inferred← citeshttps://doi.org/10.1007/bf01106605openalex-snapshot
A global optimization algorithm for linear fractional and bilinear programs
inferred← citeshttps://doi.org/10.1007/bf01197028openalex-snapshot
The repulsion algorithm, a new multistart method for global optimization
inferred← citeshttps://doi.org/10.1007/bf01582066openalex-snapshot
Global minimization by reducing the duality gap
inferred← citeshttps://doi.org/10.1007/bf01582140openalex-snapshot
An algorithm for solving convex programs with an additional convex—concave constraint
inferred← citeshttps://doi.org/10.1007/bf01582148openalex-snapshot
A new technique for generating quadratic programming test problems
inferred← citeshttps://doi.org/10.1007/bf02024487openalex-snapshot
Parallel computing in nonconvex programming
inferred← citeshttps://doi.org/10.1007/bf02096403openalex-snapshot
Constructing large feasible suboptimal intervals for constrained nonlinear optimization
inferred← citeshttps://doi.org/10.1007/bf02206826openalex-snapshot
Computational experience with penalty-barrier methods for nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02243814openalex-snapshot
Canonical D. C. programming techniques for solving a convex program with an additional constraint of multiplicative type
inferred← citeshttps://doi.org/10.1007/bf02283683openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1007/bf02430363openalex-snapshot
Designing and reporting on computational experiments with heuristic methods
inferred← citeshttps://doi.org/10.1007/bf02680551openalex-snapshot
On proving existence of feasible points in equality constrained optimization problems
inferred← citeshttps://doi.org/10.1007/bf02706823openalex-snapshot
Global optimization of chemical processes using the interval analysis
inferred← citeshttps://doi.org/10.1007/bfb0014812openalex-snapshot
Applying family competition to evolution strategies for constrained optimization
inferred← citeshttps://doi.org/10.1007/bfb0056865openalex-snapshot
Landscape changes and the performance of Mapping Based Constraint handling methods
inferred← citeshttps://doi.org/10.1007/pl00011409openalex-snapshot
Global optimization of nonconvex factorable programming problems
inferred← citeshttps://doi.org/10.1007/s00158-007-0143-1openalex-snapshot
A double-multiplicative dynamic penalty approach for constrained evolutionary optimization
inferred← citeshttps://doi.org/10.1007/s00158-018-1987-2openalex-snapshot
A RBF-based constrained global optimization algorithm for problems with computationally expensive objective and constraints
inferred← citeshttps://doi.org/10.1007/s002450010021openalex-snapshot
Solution of a General Linear Complementarity Problem Using Smooth Optimization and Its Application to Bilinear Programming and LCP
inferred← citeshttps://doi.org/10.1007/s00500-008-0349-1openalex-snapshot
AMA: a new approach for solving constrained real-valued optimization problems
inferred← citeshttps://doi.org/10.1007/s00500-013-1090-yopenalex-snapshot
A prediction-based adaptive grouping differential evolution algorithm for constrained numerical optimization
inferred← citeshttps://doi.org/10.1007/s00500-016-2166-2openalex-snapshot
Shuffled artificial bee colony algorithm
inferred← citeshttps://doi.org/10.1007/s00500-020-04853-4openalex-snapshot
Enhanced superposition determination for weighted superposition attraction algorithm
inferred← citeshttps://doi.org/10.1007/s005000050071openalex-snapshot
A Neuro-Genetic Algorithm for Heteroskedastic Time-Series Processes Empirical Tests on Global Asset Returns
inferred← citeshttps://doi.org/10.1007/s00521-024-09566-5openalex-snapshot
SHuffled Ant Lion Optimization approach with an exponentially weighted random walk strategy
inferred← citeshttps://doi.org/10.1007/s101070050072openalex-snapshot
A symmetrical linear maxmin approach to disjoint bilinear programming
inferred← citeshttps://doi.org/10.1007/s10472-019-09661-7openalex-snapshot
Dynamic search trajectory methods for global optimization
inferred← citeshttps://doi.org/10.1007/s10479-007-0224-yopenalex-snapshot
Memetic particle swarm optimization
inferred← citeshttps://doi.org/10.1007/s10479-017-2518-zopenalex-snapshot
How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
inferred← citeshttps://doi.org/10.1007/s10589-008-9208-3openalex-snapshot
Extended duality for nonlinear programming
inferred← citeshttps://doi.org/10.1007/s10589-012-9476-9openalex-snapshot
Convergence analysis of a proximal Gauss-Newton method
inferred← citeshttps://doi.org/10.1007/s10589-012-9498-3openalex-snapshot
A penalty function-based differential evolution algorithm for constrained global optimization
inferred← citeshttps://doi.org/10.1007/s10589-017-9949-yopenalex-snapshot
MINQ8: general definite and bound constrained indefinite quadratic programming
inferred← citeshttps://doi.org/10.1007/s10589-021-00325-zopenalex-snapshot
A sublevel moment-SOS hierarchy for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10614-022-10324-9openalex-snapshot
An Incentive-Compatible and Computationally Efficient Fog Bargaining Mechanism
inferred← citeshttps://doi.org/10.1007/s10878-026-01451-2openalex-snapshot
On finding all roots to systems of nonlinear equations using large language models
inferred← citeshttps://doi.org/10.1007/s10898-004-0574-9openalex-snapshot
Some Global Optimization Problems on Stiefel Manifolds
inferred← citeshttps://doi.org/10.1007/s10898-004-6097-6openalex-snapshot
Interval Branch and Bound with Local Sampling for Constrained Global Optimization
inferred← citeshttps://doi.org/10.1007/s10898-004-9971-3openalex-snapshot
Comparative Assessment of Algorithms and Software for Global Optimization
inferred← citeshttps://doi.org/10.1007/s10898-004-9972-2openalex-snapshot
A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems
inferred← citeshttps://doi.org/10.1007/s10898-005-0936-yopenalex-snapshot
A Global Optimization Method, QBB, for Twice-Differentiable Nonconvex Optimization Problem
inferred← citeshttps://doi.org/10.1007/s10898-006-9026-zopenalex-snapshot
Linearly Constrained Global Optimization and Stochastic Differential Equations
inferred← citeshttps://doi.org/10.1007/s10898-007-9152-2openalex-snapshot
A filled function method for constrained global optimization
inferred← citeshttps://doi.org/10.1007/s10898-007-9255-9openalex-snapshot
Self-adaptive velocity particle swarm optimization for solving constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9401-7openalex-snapshot
Modular global optimisation in chemical engineering
inferred← citeshttps://doi.org/10.1007/s10898-009-9472-5openalex-snapshot
A fast memoryless interval-based algorithm for global optimization
inferred← citeshttps://doi.org/10.1007/s10898-009-9477-0openalex-snapshot
The oracle penalty method
inferred← citeshttps://doi.org/10.1007/s10898-009-9485-0openalex-snapshot
Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
inferred← citeshttps://doi.org/10.1007/s10898-009-9506-zopenalex-snapshot
Piece adding technique for convex maximization problems
inferred← citeshttps://doi.org/10.1007/s10898-010-9529-5openalex-snapshot
Partitioning procedure for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10898-010-9540-xopenalex-snapshot
Study of multiscale global optimization based on parameter space partition
inferred← citeshttps://doi.org/10.1007/s10898-010-9644-3openalex-snapshot
On linear programs with linear complementarity constraints
inferred← citeshttps://doi.org/10.1007/s10898-011-9809-8openalex-snapshot
Multi-parametric disaggregation technique for global optimization of polynomial programming problems
inferred← citeshttps://doi.org/10.1007/s10898-012-9865-8openalex-snapshot
A global optimization point of view to handle non-standard object packing problems
inferred← citeshttps://doi.org/10.1007/s10898-012-9917-0openalex-snapshot
Generalized S-Lemma and strong duality in nonconvex quadratic programming
inferred← citeshttps://doi.org/10.1007/s10898-015-0292-5openalex-snapshot
Global optimality conditions and optimization methods for polynomial programming problems
inferred← citeshttps://doi.org/10.1007/s10898-015-0358-4openalex-snapshot
Global optimization with spline constraints: a new branch-and-bound method based on B-splines
inferred← citeshttps://doi.org/10.1007/s10898-015-0384-2openalex-snapshot
Delaunay-based derivative-free optimization via global surrogates, part I: linear constraints
inferred← citeshttps://doi.org/10.1007/s10898-015-0388-yopenalex-snapshot
Stochastic filter methods for generally constrained global optimization
inferred← citeshttps://doi.org/10.1007/s10898-016-0433-5openalex-snapshot
Delaunay-based derivative-free optimization via global surrogates, part II: convex constraints
inferred← citeshttps://doi.org/10.1007/s10898-020-00987-9openalex-snapshot
Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
inferred← citeshttps://doi.org/10.1007/s10957-009-9624-2openalex-snapshot
Decomposition-based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-010-9763-5openalex-snapshot
Piecewise Convex Maximization Problems: Piece Adding Technique
inferred← citeshttps://doi.org/10.1007/s10958-025-07814-0openalex-snapshot
PROBLEM-TAILORED MULTI-OBJECTIVE OPTIMIZATION ALGORITHM CONSTRUCTION BY PARETO REFLECTIONS
inferred← citeshttps://doi.org/10.1007/s11042-022-13790-3openalex-snapshot
Enhanced SFLA with spectral clustering based co-evolution for 24 constrained industrial optimization problems
inferred← citeshttps://doi.org/10.1007/s11075-010-9439-0openalex-snapshot
A projected–gradient interior–point algorithm for complementarity problems
inferred← citeshttps://doi.org/10.1007/s11075-012-9590-xopenalex-snapshot
Properties and numerical testing of a parallel global optimization algorithm
inferred← citeshttps://doi.org/10.1007/s11075-017-0366-1openalex-snapshot
Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation
inferred← citeshttps://doi.org/10.1007/s11081-009-9081-7openalex-snapshot
Adaptive range particle swarm optimization
inferred← citeshttps://doi.org/10.1007/s11081-017-9366-1openalex-snapshot
Best practices for comparing optimization algorithms
inferred← citeshttps://doi.org/10.1007/s11081-023-09874-0openalex-snapshot
A solution method for mixed-variable constrained blackbox optimization problems
inferred← citeshttps://doi.org/10.1007/s11235-010-9288-0openalex-snapshot
A line search approach for high dimensional function optimization
inferred← citeshttps://doi.org/10.1007/s11390-008-9109-zopenalex-snapshot
Analyzing the Simple Ranking and Selection Process for Constrained Evolutionary Optimization
inferred← citeshttps://doi.org/10.1007/s11590-006-0021-6openalex-snapshot
Global optimization by continuous grasp
inferred← citeshttps://doi.org/10.1007/s11590-010-0181-2openalex-snapshot
On the utility of randomly generated functions for performance evaluation of evolutionary algorithms
inferred← citeshttps://doi.org/10.1007/s11590-011-0395-yopenalex-snapshot
Attractive force search algorithm for piecewise convex maximization problems
inferred← citeshttps://doi.org/10.1007/s11590-011-0427-7openalex-snapshot
Global minimization of non-smooth unconstrained problems with filled function
inferred← citeshttps://doi.org/10.1007/s11590-015-0981-5openalex-snapshot
Inscribed ball and enclosing box methods for the convex maximization problem
inferred← citeshttps://doi.org/10.1007/s11590-024-02109-wopenalex-snapshot
Extending oscars-ii to generally constrained global optimization
inferred← citeshttps://doi.org/10.1007/s12293-014-0148-4openalex-snapshot
A computational ecosystem for optimization: review and perspectives for future research
inferred← citeshttps://doi.org/10.1007/s12532-017-0121-6openalex-snapshot
Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
inferred← citeshttps://doi.org/10.1007/s13198-012-0142-5openalex-snapshot
A novel hybrid genetic algorithm for constrained optimization
inferred← citeshttps://doi.org/10.1007/s13198-017-0640-6openalex-snapshot
Troop search optimization algorithm for constrained problems
inferred← citeshttps://doi.org/10.1007/s13675-015-0050-yopenalex-snapshot
A bounded degree SOS hierarchy for polynomial optimization
showing the first 200 of 480 · page through all 480
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.