Pages that link to "Item:Q4124613"
From MaRDI portal
The following pages link to A cutting plane algorithm for solving bilinear programs (Q4124613):
Displaying 50 items.
- A hierarchical approach for sparse source blind signal separation problem (Q336833) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Robust location transportation problems under uncertain demands (Q496635) (← links)
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points (Q817135) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- An exact penalty on bilevel programs with linear vector optimization lower level (Q1011256) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
- Hierarchical optimization: An introduction (Q1184516) (← links)
- Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
- The complementary convex structure in global optimization (Q1187368) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- A linear programming approach to solving bilinear programmes (Q1207310) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Generalized bilinear programming: An application in farm management (Q1266521) (← links)
- The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- Penalty function approach to linear trilevel programming (Q1379973) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
- Cyclic seesaw process for optimization and identification (Q1762401) (← links)
- The inverse optimal value problem (Q1769073) (← links)
- A study of local solutions in linear bilevel programming (Q1781863) (← links)
- Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints (Q1977647) (← links)
- Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game (Q2070725) (← links)
- The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
- Semidefinite programming hierarchies for constrained bilinear optimization (Q2149569) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems (Q2181561) (← links)
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) (← links)
- Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
- Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming (Q2329684) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
- The continuity of two functions associated with a maximin problem with connected variables (Q2470329) (← links)
