Pages that link to "Item:Q5890563"
From MaRDI portal
The following pages link to Convex analysis and global optimization (Q5890563):
Displaying 16 items.
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
- Interior Gradient Estimates for General Prescribed Curvature Equations (Q6202437) (← links)
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)
- Nonlinear scalarization in set optimization based on the concept of null set (Q6593837) (← links)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
- Optimality and duality for robust optimization problems involving intersection of closed sets (Q6608754) (← links)
- Joint promotional effort and assortment optimization under the multinomial logit model (Q6633266) (← links)
- Strong duality and solution existence under minimal assumptions in conic linear programming (Q6644232) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
- A note on duality in reverse convex optimization (Q6648848) (← links)
- Refinements and extensions of some strong duality theorems in conic linear programming (Q6650711) (← links)
- Self-adaptive extragradient algorithms for quasi-equilibrium problems (Q6655817) (← links)
- An algorithm to solve polytopic set optimization problem based on a partial set order relation (Q6665565) (← links)
