Pages that link to "Item:Q1315445"

The following pages link to Bilinear separation of two sets in \(n\)-space (Q1315445):

Displaying 41 items.

• Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation (Q298374) (← links)
• Auction optimization using regression trees and linear models as integer programs (Q511796) (← links)
• Primal-dual bilinear programming solution of the absolute value equation (Q694190) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• Absolute value equations (Q865400) (← links)
• Homogeneous string segmentation using trees and weighted independent sets (Q972999) (← links)
• Nonlinear separation of data via mixed 0-1 integer and linear programming (Q990586) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• Arbitrary-norm separating plane (Q1306363) (← links)
• Misclassification minimization (Q1342895) (← links)
• Hybrid extreme point tabu search (Q1609924) (← links)
• Information-theoretic feature selection with discrete \(k\)-median clustering (Q1639220) (← links)
• Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
• The inverse optimal value problem (Q1769073) (← links)
• The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
• A complementarity approach to a quasistatic multi-rigid-body contact problem (Q1815076) (← links)
• On the extended linear complementarity problem (Q1919812) (← links)
• Spherical classification of data, a new rule-based learning method (Q2038210) (← links)
• Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
• Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
• A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
• Robust approach for air cargo freight forwarder selection under disruption (Q2196089) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
• Mathematical Programming Formulations and Algorithms for Discrete <i>k</i>-Median Clustering of Time-Series Data (Q2967621) (← links)
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
• Segmenting Strings Homogeneously Via Trees (Q3508569) (← links)
• On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems (Q4641643) (← links)
• Global Optimization of Linear Multiplicative Programming Using Univariate Search (Q4982140) (← links)
• Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
• Global optimization in protein docking using clustering, underestimation and semidefinite programming (Q5437527) (← links)
• Polyhedral separability through successive LP (Q5959910) (← links)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
• An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
• A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
• A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
• A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)