Pages that link to "Item:Q5926546"
From MaRDI portal
The following pages link to Introduction to global optimization. (Q5926546):
Displaying 50 items.
- Global descent method for constrained continuous global optimization (Q278323) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
- A hierarchical approach for sparse source blind signal separation problem (Q336833) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- A global optimization algorithm for sum of linear ratios problem (Q364313) (← links)
- A reformulation framework for global optimization (Q367160) (← links)
- On the global solution of multi-parametric mixed integer linear programming problems (Q367172) (← links)
- Global optimization using a genetic algorithm with hierarchically structured population (Q390485) (← links)
- On the worst-case optimal multi-objective global optimization (Q395864) (← links)
- On box constrained concave quadratic optimization (Q398648) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Stochastic global optimization as a filtering problem (Q423021) (← links)
- Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← links)
- Stability properties of the Tikhonov regularization for nonmonotone inclusions (Q427392) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Approximation and optimization of higher order discrete and differential inclusions (Q464401) (← links)
- A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- A filling function method for unconstrained global optimization (Q493693) (← links)
- Optimizing fiber orientation in fiber-reinforced materials using efficient upscaling (Q496227) (← links)
- Some feasibility sampling procedures in interval methods for constrained global optimization (Q506473) (← links)
- On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
- Global descent methods for unconstrained global optimization (Q548179) (← links)
- Sign reversion approach to concave minimization problems (Q601974) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Global optimization over a box via canonical dual function (Q609201) (← links)
- Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization (Q609562) (← links)
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
- The directional subdifferential of the difference of two convex functions (Q628751) (← links)
- Modeling of uplink power control for cognitive radio networks: cooperative and noncooperative (Q646164) (← links)
- A modified DIviding RECTangles algorithm for a problem in astrophysics (Q650229) (← links)
- Inexact Halpern-type proximal point algorithm (Q652665) (← links)
- The directed and Rubinov subdifferentials of quasidifferentiable functions. I: Definition and examples (Q654048) (← links)
- Vector multivariate subdivision schemes: comparison of spectral methods for their regularity analysis (Q654448) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming (Q691482) (← links)
- An approach to constrained global optimization based on exact penalty functions (Q693136) (← links)
- Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
- Integrating design and production planning considerations in multi-bay manufacturing facility layout (Q703925) (← links)
- Robust resource allocations in temporal networks (Q715076) (← links)
- Filter-based DIRECT method for constrained global optimization (Q721164) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
