scientific article; zbMATH DE number 914364
From MaRDI portal
Publication:4889854
Recommendations
- scientific article; zbMATH DE number 47153
- Introduction to global optimization.
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Cited in
(only showing first 100 items - show all)- A local exploration-based differential evolution algorithm for constrained global optimization
- Criteria for global minimum of sum of squares in nonlinear regression
- Global solution of bilevel programs with a nonconvex inner program
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms
- On optimal zero-preserving corrections for inconsistent linear systems
- Hybrid approach for solving multiple-objective linear programs in outcome space
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Dynamic programming algorithms for multi-stage safety stock optimization
- Necessary and sufficient global optimality conditions for convex maximization revisited
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Dominating sets for convex functions with some applications
- Numerical solution for bounding feasible point sets
- Applications of interval arithmetic in non-smooth global optimization
- On global optimality conditions and cutting plane algorithms
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- A new filled function applied to global optimization.
- The barrier attribute of filled functions.
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- Rank-one LMI approach to simultaneous stabilization of linear systems.
- Packing equal circles in a square: A deterministic global optimization approach
- A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem
- Optimal exact tests for multiple binary endpoints
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Trigonometric spline and spectral bounds for the solution of linear time-periodic systems
- Global optimization of disjunctive programs
- The cluster problem in constrained global optimization
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Domain reduction techniques for global NLP and MINLP optimization
- Image labeling by assignment
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Global optimization in Hilbert space
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
- DC formulations and algorithms for sparse optimization problems
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- On convergence rate of a rectangular partition based global optimization algorithm
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- The hill detouring method for minimizing hinging hyperplanes functions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Global solution of semi-infinite programs
- Generalized \(\gamma\)-valid cut procedure for concave minimization
- The impelling function method applied to global optimization
- A computable filled function used for global minimization
- An inverse treatment planning model for intensity modulated radiation therapy with dynamic MLC
- Fuzzy J-means: a new heuristic for fuzzy clustering
- An algebra-based approach for linearly constrained concave minimization
- A stochastic approach to global optimization of nonlinear programming problem with many equality constraints
- An optimization algorithm inspired by social creativity systems
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Explicit convex and concave envelopes through polyhedral subdivisions
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
- Portfolio optimization for wealth-dependent risk preferences
- Global optimization problems and domain reduction strategies
- DC programming: overview.
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Incremental method for multiple line detection problem -- iterative reweighted approach
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- A new algorithm for concave quadratic programming
- Acceleration procedure for special classes of multi-extremal problems
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Convergent upper bounds in global minimization with nonlinear equality constraints
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- Underestimation functions for a rank-two partitioning method
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- Deterministic global optimization with Gaussian processes embedded
- Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit
- Identification of mechanical properties of arteries with certification of global optimality
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
- A local search scheme for the inequality-constrained optimal control problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- An optimization method for chaotic turbulent flow
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- A revision of the rectangular algorithm for a class of DC optimization problems
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
- Reservoir computing for forecasting large spatiotemporal dynamical systems
- A new framework to relax composite functions in nonlinear programs
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Simplicial Lipschitz optimization without the Lipschitz constant
- Rounding on the standard simplex: regular grids for global optimization
- Globally-biased disimpl algorithm for expensive global optimization
- A cutting plane method for bilevel linear programming with interval coefficients
- On tightness and anchoring of McCormick and other relaxations
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
- A scalable global optimization algorithm for stochastic nonlinear programs
- A local search method for optimization problem with d.c. inequality constraints
- Steklov regularization and trajectory methods for univariate global optimization
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Approximating roots of nonlinear systems by \(\alpha\)-dense curves
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889854)
