Finding the nearest point in A polytope

Cites Work

Title not available (Why is that?)
Linear and Nonlinear Separation of Patterns by Linear Programming
Finding the Point of a Polyhedron Closest to the Origin
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
A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
Title not available (Why is that?)
Title not available (Why is that?)
A finite algorithm to maximize certain pseudoconcave functions on polytopes
A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
Smallest point of a polytope
A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
A critical index algorithm for nearest point problems on simplicial cones
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Gauss-Seidel method for least-distance problems
Zonotopes and the LP-Newton method
Least distance methods for the frame of homogeneous equation systems
Improving feasible directions for a class of nondifferentiable functions
Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
A Method for Minimization of Quasidifferentiable Functions
An approximate algorithm for computing multidimensional convex hulls
Codifferential method for minimizing nonsmooth DC functions
The nearest point problem in a polyhedral set and its extensions
A method for minimizing convex functions based on continuous approximations to the subdifferential
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
Convex quadratic programming with one constraint and bounded variables
An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
Joint trajectory generation for redundant robots in an environment with obstacles
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
Descent methods for quasidifferentiable minimization
An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
Convergence of \(r\)-algorithms
Fixed point optimization algorithm and its application to power control in CDMA data networks
Efficient computation of the Hausdorff distance between polytopes by exterior random covering
Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
Two-direction subgradient method for non-differentiable optimization problems
The steepest descent gravitational method for linear programming
An active index algorithm for the nearest point problem in a polyhedral cone
Method of successive projections for finding a common point of sets in metric spaces
Simplicial decomposition in nonlinear programming algorithms
Extension of the LP-Newton method to conic programming problems via semi-infinite representation
Computing deep facet-defining disjunctive cuts for mixed-integer programming
Solving \(0/1\) integer programs with enumeration cutting planes
The LP-Newton method for standard form linear programming problems
A stable method for solving certain constrained least squares problems
An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
Reflections on generating (disjunctive) cuts
An effective nonsmooth optimization algorithm for locally Lipschitz functions
A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
Single-projection procedure for linear optimization
Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
An algorithm for minimizing clustering functions
An algorithm for linear least squares problems with equality and nonnegativity constraints
On Poljak's improved subgradient method
A survey on the continuous nonlinear resource allocation problem
An aggregate subgradient method for nonsmooth convex minimization
Title not available (Why is that?)
Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization
Least distance methods for the scheme of polytopes
The distance between two convex sets
Discrete gradient method: Derivative-free method for nonsmooth optimization
Variable metric methods for linearly constrained nonlinear minimax approximation
CP-rays in simplicial cones
A regularized decomposition method for minimizing a sum of polyhedral functions
On a space extension algorithm for nondifferentiable optimization
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
A subgradient-type method for the equilibrium problem over the fixed point set and its applications
Exterior point algorithms for nearest points and convex quadratic programs
Minimizing pseudoconvex functions on convex compact sets
Separating plane algorithms for convex optimization
A multidimensional descent method for global optimization
The colourful feasibility problem
A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
Novel approaches to the discrimination problem
Linearly constrained estimation by mathematical programming
An illumination problem: optimal apex and optimal orientation for a cone of light
An ODE-based approach to nonlinearly constrained minimax problems
A compact variable metric algorithm for nonlinear minimax approximation
On a Reduction for a Class of Resource Allocation Problems
Minimization of locally defined submodular functions by optimal soft arc consistency
Error bounds for solutions of linear equations and inequalities
A subgradient algorithm for certain minimax and minisum problems
Activity preserving graph simplification
Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
Stabilizing control design for state-dependent impulsive dynamical linear systems
The problem of projecting the origin of Euclidean space onto the convex polyhedron
Linear classifier and projection onto a polytope
Rescaled Coordinate Descent Methods for Linear Programming
Row-Oriented Decomposition in Large-Scale Linear Optimization
A competitive solution for cooperative truckload delivery
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
Title not available (Why is that?)
Rescaling Algorithms for Linear Conic Feasibility
Title not available (Why is that?)
An algorithm for the estimation of a regression function by continuous piecewise linear functions
An augmented subgradient method for minimizing nonsmooth DC functions
A difference of convex optimization algorithm for piecewise linear regression
Essentials of numerical nonsmooth optimization
Pseudoconvex optimization for a special problem of paint industry
A simple projection algorithm for linear programming problems
A neural network measuring the intersection of \(m\)-dimensional convex polyhedra
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
A trust region method for solving linearly constrained locally Lipschitz optimization problems
Robust budget allocation via continuous submodular functions
The distance between convex sets with Minkowski sum structure: application to collision detection
A gravitational interior point method for LP.
An interior point algorithm for large scale portfolio optimization

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)