Monotonic Optimization: Problems and Solution Approaches
From MaRDI portal
Publication:2706339
DOI10.1137/S1052623499359828zbMath1010.90059MaRDI QIDQ2706339
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
monotonicityglobal optimizationnonconvex quadratic programmingdistance geometrypolynomial programmingincreasing functionsmultiplicative programmingdifference of increasing functionsnormal setspolyblock approximation algorithms
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Quadratic programming (90C20) Optimization problems in optics and electromagnetic theory (78M50)
Related Items
A robust algorithm for quadratic optimization under quadratic constraints, Optimization of a quadratic function with a circulant matrix, Generalized S-lemma and strong duality in nonconvex quadratic programming, Conjugate duality and optimization over weakly efficient set, Relative entropy and envy-free allocation, Continuous approximation of linear impulsive systems and a new form of robust stability, On convexification for a class of global optimization problems, Efficient presolving methods for the influence maximization problem, Monotonic optimization based decoding for linear codes, On global optimality conditions and cutting plane algorithms, Some results on augmented Lagrangians in constrained global optimization via image space analysis, Unnamed Item, A class of convexification and concavification methods for non-monotone optimization problems, A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization, Convexification of nonsmooth monotone functions, A robust algorithm for generalized geometric programming, On a decomposition method for nonconvex global optimization, A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints, A novel approach to bilevel nonlinear programming, Solving knapsack problems with \(S\)-curve return functions, Nonconcave utility maximisation in the MIMO broadcast channel, A new topological minimax theorem with application, Global optimization for the generalized polynomial sum of ratios problem, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, A branch-and-bound based method for solving monotone optimization problems, A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects, Monotonic optimization for sensor cover energy problem, A nonisolated optimal solution for special reverse convex programming problems, Problems with resource allocation constraints and optimization over the efficient set, A nonisolated optimal solution of general linear multiplicative programming problems, Solving sum of quadratic ratios fractional programs via monotonic function, Global optimization from concave minimization to concave mixed variational inequality, Robust solution of nonconvex global optimization problems, A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
