Pages that link to "Item:Q4136948"
From MaRDI portal
The following pages link to A Successive Underestimation Method for Concave Minimization Problems (Q4136948):
Displaying 50 items.
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- A generalized duality and applications (Q686992) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Minimization of a quasi-concave function over an efficient set (Q689154) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- An exact penalty on bilevel programs with linear vector optimization lower level (Q1011256) (← links)
- Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
- Convex programs with an additional reverse convex constraint (Q1071651) (← links)
- An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
- Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
- On the structure and properties of a linear multilevel programming problem (Q1095807) (← links)
- Outer approximation by polyhedral convex sets (Q1101351) (← links)
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872) (← links)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
- Minimizing a quasi-concave function subject to a reverse convex constraint (Q1108198) (← links)
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
- A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems (Q1145624) (← links)
- Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints (Q1148807) (← links)
- Algorithms for parametric nonconvex programming (Q1158344) (← links)
- Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming (Q1162457) (← links)
- On the minimization of a quasi-concave function subject to linear constraints (Q1178718) (← links)
- Multi-level programming and conflict resolution (Q1179198) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
- Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- Computational approaches to variance-penalised Markov decision processes (Q1198139) (← links)
- A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
- A linear programming approach to solving bilinear programmes (Q1207310) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- A mathematical programming approach to a problem in variance penalised Markov decision processes (Q1317531) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- A generalization of the construction of test problems for nonconvex optimization (Q1330804) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
- Monotone variable-metric algorithm for linearly constrained nonlinear programming (Q1579655) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation (Q1751867) (← links)
- Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program (Q1821694) (← links)
- Convex minimization under Lipschitz constraints (Q1823144) (← links)
- A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
- Least trimmed squares regression, least median squares regression, and mathematical program\-ming (Q1876766) (← links)
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
