Pages that link to "Item:Q5906869"
From MaRDI portal
The following pages link to Convex analysis and global optimization (Q5906869):
Displaying 50 items.
- Global descent method for constrained continuous global optimization (Q278323) (← links)
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
- On local search in d.c. optimization problems (Q299416) (← links)
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
- Positively homogeneous functions revisited (Q346810) (← links)
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs (Q408205) (← links)
- A global optimization procedure for the location of a median line in the three-dimensional space (Q421608) (← links)
- A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (Q427360) (← links)
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← links)
- Solving DC programs using the cutting angle method (Q486726) (← links)
- Constant rebalanced portfolio optimization under nonlinear transaction costs (Q538327) (← links)
- Convexification and concavification for a general class of global optimization problems (Q556003) (← links)
- Sign reversion approach to concave minimization problems (Q601974) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization (Q656831) (← links)
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations (Q694844) (← links)
- An inner approximation method incorporating with a penalty function method for a reverse convex programming problem (Q697546) (← links)
- Maximization of generalized convex functionals in locally convex spaces. (Q703177) (← links)
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- Functional inequalities and theorems of the alternative involving composite functions (Q743970) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- On the solution existence to convex polynomial programs and its applications (Q828698) (← links)
- Asset price bubbles, market liquidity, and systemic risk (Q829205) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
- Optimization of a quadratic function with a circulant matrix (Q853879) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Reverse convex problems: an approach based on optimality conditions (Q868408) (← links)
- A search algorithm for calculating validated reliability bounds (Q868688) (← links)
- Computing lower and upper expectations under epistemic independence (Q881798) (← links)
- Neural network for constrained nonsmooth optimization using Tikhonov regularization (Q889405) (← links)
- Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
- A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
- A filled function method for constrained global optimization (Q925228) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
- A method for approximating pairwise comparison matrices by consistent matrices (Q956601) (← links)
- The design of optimum component test plans for system reliability (Q959396) (← links)
- \(\alpha \)-conservative approximation for probabilistically constrained convex programs (Q969716) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- Global optimality conditions for some classes of optimization problems (Q970570) (← links)
