Finding the nearest point in A polytope

Cites work

A finite algorithm to maximize certain pseudoconcave functions on polytopes
A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
Finding the Point of a Polyhedron Closest to the Origin
scientific article; zbMATH DE number 3523319 (Why is no real title available?)
scientific article; zbMATH DE number 3526459 (Why is no real title available?)
scientific article; zbMATH DE number 3561096 (Why is no real title available?)
scientific article; zbMATH DE number 3323651 (Why is no real title available?)
Linear and Nonlinear Separation of Patterns by Linear Programming

Cited in

(only showing first 100 items - show all)

Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
Minimization of locally defined submodular functions by optimal soft arc consistency
Variable metric methods for linearly constrained nonlinear minimax approximation
On a space extension algorithm for nondifferentiable optimization
A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
A compact variable metric algorithm for nonlinear minimax approximation
On Poljak's improved subgradient method
Least distance methods for the frame of homogeneous equation systems
Improving feasible directions for a class of nondifferentiable functions
Descent methods for quasidifferentiable minimization
Smallest point of a polytope
Minimizing pseudoconvex functions on convex compact sets
Finding the closest point to the origin in the convex hull of a discrete set of points
Linearly constrained estimation by mathematical programming
An approximate algorithm for computing multidimensional convex hulls
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
An interior point algorithm for large scale portfolio optimization
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
Gauss-Seidel method for least-distance problems
An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
Solving \(0/1\) integer programs with enumeration cutting planes
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
Pseudoconvex optimization for a special problem of paint industry
Finding the projection on a polytope: An iterative method
Separating plane algorithms for convex optimization
An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
Approximate solution of Hamilton-Jacobi inequality by neural networks
A maximum \(L_p\) distance problem
An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
A simple projection algorithm for linear programming problems
Efficient computation of the Hausdorff distance between polytopes by exterior random covering
Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils
Convergence of r-algorithms
A neural network measuring the intersection of m-dimensional convex polyhedra
An ODE-based approach to nonlinearly constrained minimax problems
A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
Equivalence of convex minimization problems over base polytopes
An effective nonsmooth optimization algorithm for locally Lipschitz functions
Robust budget allocation via continuous submodular functions
The distance between convex sets with Minkowski sum structure: application to collision detection
Design of the best linear classifier for box-constrained data sets
Stabilizing control design for state-dependent impulsive dynamical linear systems
Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Linear classifier and projection onto a polytope
Extension of the LP-Newton method to conic programming problems via semi-infinite representation
An augmented subgradient method for minimizing nonsmooth DC functions
Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
An illumination problem: optimal apex and optimal orientation for a cone of light
Combination of the hybrid steepest-descent method and the viscosity approximation
An algorithm for the estimation of a regression function by continuous piecewise linear functions
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
A modified quasisecant method for global optimization
A difference of convex optimization algorithm for piecewise linear regression
Central axes and peripheral points in high dimensional directional datasets
The problem of projecting the origin of Euclidean space onto the convex polyhedron
Submodular functions: from discrete to continuous domains
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Activity preserving graph simplification
The LP-Newton method for standard form linear programming problems
A survey on the continuous nonlinear resource allocation problem
A gravitational interior point method for LP.
The distance between two convex sets
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
A projected gradient method for optimization over density matrices
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
Theory of principal partitions revisited
An aggregate subgradient method for nonsmooth convex minimization
The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set
Rescaled coordinate descent methods for linear programming
Single-projection procedure for linear optimization
scientific article; zbMATH DE number 3880447 (Why is no real title available?)
Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization
A subgradient-type method for the equilibrium problem over the fixed point set and its applications
scientific article; zbMATH DE number 3956831 (Why is no real title available?)
A regularized decomposition method for minimizing a sum of polyhedral functions
Convex quadratic programming with one constraint and bounded variables
Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
An algorithm for linear least squares problems with equality and nonnegativity constraints
An algorithm for least distance programming
A critical index algorithm for nearest point problems on simplicial cones
Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
Novel approaches to the discrimination problem
Joint trajectory generation for redundant robots in an environment with obstacles
Simplicial decomposition in nonlinear programming algorithms
A subgradient algorithm for certain minimax and minisum problems
Least distance methods for the scheme of polytopes
A stable method for solving certain constrained least squares problems
Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
Fixed point optimization algorithm and its application to power control in CDMA data networks
A method for minimizing convex functions based on continuous approximations to the subdifferential
Compact convex projections
A trust region method for solving linearly constrained locally Lipschitz optimization problems
Reflections on generating (disjunctive) cuts
Method of conditional ?-subgradient for solving convex programming problems

This page was built for publication: Finding the nearest point in A polytope

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