Pages that link to "Item:Q1899195"
From MaRDI portal
The following pages link to Introduction to global optimization (Q1899195):
Displayed 46 items.
- The controlled estimation method in the multiobjective linear fractional problem (Q1885953) (← links)
- Finding all solutions of nonlinearly constrained systems of equations (Q1904647) (← links)
- A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
- Linearly constrained global minimization of functions with concave minorants (Q1918299) (← links)
- Modified T-F function method for finding global minimizer on unconstrained optimization (Q1958866) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- DC programming: overview. (Q1969457) (← links)
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem (Q1971990) (← links)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function (Q2271151) (← links)
- Probability of unique integer solution to a system of linear equations (Q2275621) (← links)
- A filled function method for global optimization (Q2372909) (← links)
- Simple transformation functions for finding better minima (Q2425403) (← links)
- The joint replenishment problem with variable production costs (Q2432876) (← links)
- An extension of gap functions for a system of vector equilibrium problems with applications to optimization problems (Q2454728) (← links)
- Adaptive extremal optimization by detrended fluctuation analysis (Q2465006) (← links)
- Two level minimization in multidimensional scaling (Q2465484) (← links)
- A global minimization algorithm for Lipschitz functions (Q2465562) (← links)
- Solving 0-1 programming problems by a penalty approach. (Q2468556) (← links)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- Mean-variance portfolio optimal problem under concave transaction cost (Q2490186) (← links)
- A soft approach for hard continuous optimization (Q2491765) (← links)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← links)
- Second-order sufficient optimality conditions for local and global nonlinear programming (Q2564610) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
- Solving sum-of-ratios fractional programs using efficient points (Q2743661) (← links)
- A global optimization approach for generating efficient points for multiobjective concave fractional programs (Q3074953) (← links)
- Automatic loop shaping in QFT using hybrid optimization and constraint propagation techniques (Q3418076) (← links)
- Time—Frequency Analysis of Brain Neurodynamics (Q3565462) (← links)
- Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers (Q3613504) (← links)
- Difference convex optimization techniques in nonsmooth computational mechanics (Q4354081) (← links)
- Comparative analysis of the cutting angle and simulated annealing methods in global optimization (Q4467167) (← links)
- A Complexity Analysis of Local Search Algorithms in Global Optimization (Q4806344) (← links)
- What is quasiconvex analysis? (Q4949175) (← links)
- A parameter-free filled function for unconstrained global optimization (Q5313426) (← links)
- A gradually descent method for discrete global optimization (Q5436248) (← links)
- Complexity of general continuous minimization problems: a survey (Q5717540) (← links)
- Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726) (← links)
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734) (← links)
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925735) (← links)
- Generalized quasilinearization for quasilinear parabolic equations with nonlinearities of DC type (Q5942343) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)