Finding the nearest point in A polytope

Cites work

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?)
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
A finite algorithm to maximize certain pseudoconcave functions on polytopes
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
Linear and Nonlinear Separation of Patterns by Linear Programming

Cited in

(only showing first 100 items - show all)

Rescaled coordinate descent methods for linear programming
Efficient methods for verifying monotonicity of 2-additive fuzzy measures
Exterior point algorithms for nearest points and convex quadratic programs
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
Minimizing pseudoconvex functions on convex compact sets
Method of conditional ?-subgradient for solving convex programming problems
Finding the closest point to the origin in the convex hull of a discrete set of points
A subgradient-type method for the equilibrium problem over the fixed point set and its applications
Separating plane algorithms for convex optimization
scientific article; zbMATH DE number 3956831 (Why is no real title available?)
The colourful feasibility problem
Central axes and peripheral points in high dimensional directional datasets
A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
A multidimensional descent method for global optimization
The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set
Combination of the hybrid steepest-descent method and the viscosity approximation
Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
Novel approaches to the discrimination problem
Linearly constrained estimation by mathematical programming
Variable metric method for unconstrained multiobjective optimization problems
Approximate solution of Hamilton-Jacobi inequality by neural networks
Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
An illumination problem: optimal apex and optimal orientation for a cone of light
Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
A compact variable metric algorithm for nonlinear minimax approximation
An ODE-based approach to nonlinearly constrained minimax problems
A projected gradient method for optimization over density matrices
A maximum \(L_p\) distance problem
Design of the best linear classifier for box-constrained data sets
Minimization of locally defined submodular functions by optimal soft arc consistency
On a Reduction for a Class of Resource Allocation Problems
Error bounds for solutions of linear equations and inequalities
An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
A subgradient algorithm for certain minimax and minisum problems
Essentials of numerical nonsmooth optimization
Activity preserving graph simplification
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
Gauss-Seidel method for least-distance problems
Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
Stabilizing control design for state-dependent impulsive dynamical linear systems
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Linear classifier and projection onto a polytope
The problem of projecting the origin of Euclidean space onto the convex polyhedron
Zonotopes and the LP-Newton method
A critical index algorithm for nearest point problems on simplicial cones
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
Row-Oriented Decomposition in Large-Scale Linear Optimization
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
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
A competitive solution for cooperative truckload delivery
A Method for Minimization of Quasidifferentiable Functions
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
A method for minimizing convex functions based on continuous approximations to the subdifferential
Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
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
An algorithm for the estimation of a regression function by continuous piecewise linear functions
Convex quadratic programming with one constraint and bounded variables
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
scientific article; zbMATH DE number 7255066 (Why is no real title available?)
An augmented subgradient method for minimizing nonsmooth DC functions
Descent methods for quasidifferentiable minimization
A difference of convex optimization algorithm for piecewise linear regression
An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
Joint trajectory generation for redundant robots in an environment with obstacles
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
Pseudoconvex optimization for a special problem of paint industry
Essentials of numerical nonsmooth optimization
A simple projection algorithm for linear programming problems
Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
A neural network measuring the intersection of m-dimensional convex polyhedra
Two-direction subgradient method for non-differentiable optimization problems
The steepest descent gravitational method for linear programming
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
Robust budget allocation via continuous submodular functions
An active index algorithm for the nearest point problem in a polyhedral cone
The distance between convex sets with Minkowski sum structure: application to collision detection
Method of successive projections for finding a common point of sets in metric spaces
A trust region method for solving linearly constrained locally Lipschitz optimization problems
Simplicial decomposition in nonlinear programming algorithms
Computing deep facet-defining disjunctive cuts for mixed-integer programming
Extension of the LP-Newton method to conic programming problems via semi-infinite representation
A gravitational interior point method for LP.
An interior point algorithm for large scale portfolio optimization
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
Solving \(0/1\) integer programs with enumeration cutting planes
A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods
The LP-Newton method for standard form linear programming problems
An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
Reflections on generating (disjunctive) cuts

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)