Pages that link to "Item:Q5926546"

The following pages link to Introduction to global optimization. (Q5926546):

Displaying 50 items.

• DC programming techniques for solving a class of nonlinear bilevel programs (Q839322) (← links)
• New results on the equivalence between zero-one programming and continuous concave programming (Q839801) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
• Improved strategies for radial basis function methods for global optimization (Q868637) (← links)
• A new exclusion test for finding the global minimum (Q869487) (← links)
• Challenges of continuous global optimization in molecular structure prediction (Q877606) (← links)
• Parallel radial basis function methods for the global optimization of expensive functions (Q881510) (← links)
• The approximation algorithm for solving a sort of non-smooth programming (Q884618) (← links)
• Continuous piecewise linear delta-approximations for bivariate and multivariate functions (Q887097) (← links)
• Fast Gaussian kernel learning for classification tasks based on specially structured global optimization (Q889286) (← links)
• Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems (Q896176) (← links)
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
• The spherical constraint in Boolean quadratic programs (Q925238) (← links)
• Optimality conditions for linear programming problems with fuzzy coefficients (Q945184) (← links)
• An exact method for a discrete multiobjective linear fractional optimization (Q952706) (← links)
• Finding optimal vaccination strategies under parameter uncertainty using stochastic program\-ming (Q954065) (← links)
• The design of optimum component test plans for system reliability (Q959396) (← links)
• Bisecton by global optimization revisited (Q965055) (← links)
• Coerciveness property for conical nonsmooth functionals (Q970576) (← links)
• Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
• Exact penalty functions for nonlinear integer programming problems (Q983724) (← links)
• Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514) (← links)
• A new branch and bound method with pretreatment for the binary quadratic programming (Q990519) (← links)
• On the subdifferentiability of the difference of two functions and local minimization (Q1005123) (← links)
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
• Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality (Q1037375) (← links)
• The optimality conditions for optimization problems with convex constraints and multiple fuzzy-valued objective functions (Q1037442) (← links)
• On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
• Numerical solution for bounding feasible point sets (Q1398432) (← links)
• Lower bound functions for polynomials (Q1405189) (← links)
• On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
• Flow search approach and new bounds for the \(m\)-step linear conjugate gradient algorithm (Q1431700) (← links)
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
• Autonomous agents modelling other agents: a comprehensive survey and open problems (Q1639697) (← links)
• Singular optimal control by minimizer flows (Q1663034) (← links)
• An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
• The Karush-Kuhn-Tucker optimality conditions for the fuzzy optimization problems in the quotient space of fuzzy numbers (Q1674943) (← links)
• A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
• On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
• A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
• Gradient surfing: a new deterministic approach for low-dimensional global optimization (Q1730775) (← links)
• Visualization of a statistical approximation of the Pareto front (Q1732235) (← links)
• MINQ8: general definite and bound constrained indefinite quadratic programming (Q1744884) (← links)
• A dynamic game approach to distributionally robust safety specifications for stochastic systems (Q1797093) (← links)
• Dictionary learning for fast classification based on soft-thresholding (Q1799991) (← links)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• Multi-resource allocation in stochastic project scheduling (Q1931636) (← links)