scientific article; zbMATH DE number 914364
From MaRDI portal
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)- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Global optimization of bounded factorable functions with discontinuities
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Globally-biased disimpl algorithm for expensive global optimization
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Quadratic support functions in quadratic bilevel problems
- Rank-one LMI approach to simultaneous stabilization of linear systems.
- An inverse treatment planning model for intensity modulated radiation therapy with dynamic MLC
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms
- Solving the median problem with continuous demand on a network
- Hybrid Behavioral-Based Multiobjective Space Trajectory Optimization
- Reachability analysis and deterministic global optimization of DAE models
- Global optimization of a rank-two nonconvex program
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Linear scaling and the DIRECT algorithm
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- LMI approximations for the radius of the intersection of ellipsoids: Survey.
- The design of optimum component test plans for system reliability
- On local search in d.c. optimization problems
- Bayesian stopping rule in discrete parameter space with multiple local maxima
- Using projected cutting planes in the extended cutting plane method
- Relaxations of factorable functions with convex-transformable intermediates
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- Equidistant and \(D\)-optimal designs for parameters of Ornstein-Uhlenbeck process
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Numerical solution for bounding feasible point sets
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- DC programming: overview.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games
- An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- On the hierarchy of γ-valid cuts in global optimization
- A Search Algorithm for the Global Extremum of a Discontinuous Function
- On solving the sum-of-ratios problem
- Finding roots of nonlinear equations using the method of concave support functions
- Geometric branch-and-bound methods for constrained global optimization problems
- Rounding on the standard simplex: regular grids for global optimization
- Global optimization of disjunctive programs
- Approximating roots of nonlinear systems by \(\alpha\)-dense curves
- Incremental method for multiple line detection problem -- iterative reweighted approach
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
- Inner approximation method for a reverse convex programming problem
- A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation
- A new constructing auxiliary function method for global optimization
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- Variations and extension of the convex-concave procedure
- A local search scheme for the inequality-constrained optimal control problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- Outer approximation method incorporating a quadratic approximation for a DC programming problem
- Image labeling by assignment
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Probabilistic subproblem selection in branch-and-bound algorithms
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
- Steklov regularization and trajectory methods for univariate global optimization
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Global solution of bilevel programs with a nonconvex inner program
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- A class of generalized filled functions with improved computability
- Acceleration procedure for special classes of multi-extremal problems
- A hybrid method for quantum global optimization
- A new framework to relax composite functions in nonlinear programs
- Rank-two programs involving linear fractional functions
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization
- scientific article; zbMATH DE number 778142 (Why is no real title available?)
- DC formulations and algorithms for sparse optimization problems
- A stochastic approach to global optimization of nonlinear programming problem with many equality constraints
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- A generalization of -subdivision ensuring convergence of the simplicial algorithm
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Simplicial Lipschitz optimization without the Lipschitz constant
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- A new filled function applied to global optimization.
- The barrier attribute of filled functions.
- Optimization of the norm of a vector-valued DC function and applications
- Computational optimization of the vortex manufacturing of advanced materials
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- The problems of non-convex quadratic programming related to phased antenna arrays optimization
- Two-stage quadratic integer programs with stochastic right-hand sides
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
- An algorithm for nonlinear optimization problems with binary variables
- On tightness and anchoring of McCormick and other relaxations
- Necessary and sufficient global optimality conditions for convex maximization revisited
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods
- Nonlinear optimization with GAMS /LGO
- Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation
- A cutting plane method for bilevel linear programming with interval coefficients
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)
