Pages that link to "Item:Q4117584"
From MaRDI portal
The following pages link to Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints (Q4117584):
Displaying 21 items.
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Generalized bilinear programming: An application in farm management (Q1266521) (← links)
- A penalty function approach for solving bi-level linear programs (Q1310974) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- Clustering with missing features: a penalized dissimilarity measure based approach (Q1722735) (← links)
- Global optimization for the biaffine matrix inequality problem (Q1913606) (← links)
- Regularized joint estimation of related vector autoregressive models (Q2002726) (← links)
- Piecewise convexity of artificial neural networks (Q2292218) (← links)
- Biconvex sets and optimization with biconvex functions: a survey and extensions (Q2465382) (← links)
- Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches (Q2514869) (← links)
- Optimization of linear-convex programs (Q3835613) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography (Q5044977) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps (Q5348468) (← links)
- Improvement of the LMI change of variables for multi‐objective control design problems (Q5415719) (← links)
- Supervised-distributed control with joint performance and communication optimisation (Q5863715) (← links)
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems (Q6066721) (← links)
- A multi-granularity locally optimal prototype-based approach for classification (Q6071250) (← links)
- Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate (Q6601549) (← links)
