Bilinear separation of two sets in n-space

DOI10.1007/BF01299449zbMATH Open0795.90060MaRDI QIDQ1315445FDOQ1315445

Authors: Kristin P. Bennett, O. L. Mangasarian 

Publication date: 10 March 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Recommendations

• On the complexity of polyhedral separability
• Set separation problems and global optimization.
• The surgical separation of sets
• Separation of two sets by piecewise linear function
• Lower bounds for the number of hyperplanes separating two finite sets of points

zbMATH Keywords

neural networksnecessary optimality conditionbilinear programbilinear separation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Neural networks for/in biological studies, artificial life and related topics (92B20)

Cites Work

• Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
• Convex Analysis
• Title not available (Why is that?)
• On the complexity of polyhedral separability
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Jointly Constrained Biconvex Programming
• Linear multiplicative programming
• Title not available (Why is that?)
• A note on the solution of bilinear programming problems by reduction to concave minimization
• A linear programming approach to solving bilinear programmes
• Title not available (Why is that?)
• Multisurface method of pattern separation
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• Characterization of linear complementarity problems as linear programs
• Title not available (Why is that?)
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Title not available (Why is that?)

Cited In (44)

• The inverse optimal value problem
• Global optimization of linear multiplicative programming using univariate search
• Global optimization algorithm for solving linear multiplicative programming problems
• A nonisolated optimal solution of general linear multiplicative programming problems
• A characterization of 2-threshold functions via pairs of prime segments
• Primal-dual bilinear programming solution of the absolute value equation
• Homogeneous string segmentation using trees and weighted independent sets
• Title not available (Why is that?)
• Information-theoretic feature selection with discrete \(k\)-median clustering
• Absolute value equations
• An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
• Cardinality minimization, constraints, and regularization: a survey
• An outcome-space finite algorithm for solving linear multiplicative programming
• Polyhedral separability through successive LP
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
• Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation
• Global optimization method for linear multiplicative programming
• Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
• Hybrid extreme point tabu search
• A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
• Mathematical programming formulations and algorithms for discrete \(k\)-median clustering of time-series data
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
• The linear complementarity problem as a separable bilinear program
• Spherical classification of data, a new rule-based learning method
• Numerical search for global solutions in problems of non-symmetric bilinear separability
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• Global optimization in protein docking using clustering, underestimation and semidefinite programming
• A method based on parametric convex programming for solving convex multiplicative programming problem
• Data separation via a finite number of discriminant functions: a global optimization approach
• Approximating a linear multiplicative objective in watershed management optimization
• On deterministic reformulations of distributionally robust joint chance constrained optimization problems
• On the extended linear complementarity problem
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
• A novel branch-and-bound algorithm for solving linear multiplicative programming problems
• Segmenting Strings Homogeneously Via Trees
• Lower bounds for the number of hyperplanes separating two finite sets of points
• Arbitrary-norm separating plane
• Misclassification minimization
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• Auction optimization using regression trees and linear models as integer programs
• Robust approach for air cargo freight forwarder selection under disruption
• A complementarity approach to a quasistatic multi-rigid-body contact problem
• Nonlinear separation of data via mixed 0-1 integer and linear programming
• Global optimization for generalized linear multiplicative programming using convex relaxation

Uses Software

• MINOS

This page was built for publication: Bilinear separation of two sets in \(n\)-space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315445)