Monotonic optimization: Problems and solution approaches
From MaRDI portal
(Redirected from Publication:2706339)
Recommendations
Cited in
(55)- Solving knapsack problems with \(S\)-curve return functions
- A nonisolated optimal solution of general linear multiplicative programming problems
- Maximization for inner products under quasi-monotone constraints
- Nonconcave utility maximisation in the MIMO broadcast channel
- A new topological minimax theorem with application
- Matrix-Monotonic Optimization $-$ Part I: Single-Variable Optimization
- A new approach to optimization under monotonic constraint
- Efficient presolving methods for the influence maximization problem
- Conjugate duality and optimization over weakly efficient set
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization
- A branch-and-bound based method for solving monotone optimization problems
- On convexification for a class of global optimization problems
- Monotonic optimization techniques for solving knapsack problems
- Application of the -monotonicity to the search for optimal solutions in higher-dimensional problems
- An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
- Monotonic Optimization: Branch and Cut Methods
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A hyper-transformer model for controllable Pareto front learning with split feasibility constraints
- Continuous approximation of linear impulsive systems and a new form of robust stability
- Problems with resource allocation constraints and optimization over the efficient set
- scientific article; zbMATH DE number 7033214 (Why is no real title available?)
- Ameso optimization: a relaxation of discrete midpoint convexity
- Some results on augmented Lagrangians in constrained global optimization via image space analysis
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- On global optimality conditions and cutting plane algorithms
- Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
- A novel approach to bilevel nonlinear programming
- Optimization under composite monotonic constraints and constrained optimization over the efficient set
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- A robust algorithm for quadratic optimization under quadratic constraints
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
- A robust algorithm for generalized geometric programming
- Monotonic optimization in communication and networking systems
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- A class of convexification and concavification methods for non-monotone optimization problems
- Relative entropy and envy-free allocation
- Monotonic optimization based decoding for linear codes
- Global optimization from concave minimization to concave mixed variational inequality
- Monotonic optimization for sensor cover energy problem
- Global optimization for the generalized polynomial sum of ratios problem
- Solving sum of quadratic ratios fractional programs via monotonic function
- A nonisolated optimal solution for special reverse convex programming problems
- Robust solution of nonconvex global optimization problems
- scientific article; zbMATH DE number 2159407 (Why is no real title available?)
- Methods of multiextremal optimization under constraints for separably quasimonotone functions
- On a decomposition method for nonconvex global optimization
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Monotone function problems and statistical selection procedures
- Normal sets, polyblocks, and monotonic optimization
- Convexification of nonsmooth monotone functions
- Convexification and monotone optimization
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- An alogrithm for monotonic global optimization problems∗
- Optimization of polynomial fractional functions
- Optimization of a quadratic function with a circulant matrix
This page was built for publication: Monotonic optimization: Problems and solution approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706339)
