Finding the nearest point in A polytope
From MaRDI portal
Publication:4123085
DOI10.1007/BF01580381zbMath0352.90046MaRDI QIDQ4123085
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Polytopes and polyhedra (52Bxx)
Related Items
A Method for Minimization of Quasidifferentiable Functions, A trust region method for solving linearly constrained locally Lipschitz optimization problems, An algorithm for minimizing clustering functions, Unnamed Item, 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, Error bounds for solutions of linear equations and inequalities, On a Reduction for a Class of Resource Allocation Problems, Variable metric method for unconstrained multiobjective optimization problems, Novel approaches to the discrimination problem, An update-and-stabilize framework for the minimum-norm-point problem, Joint trajectory generation for redundant robots in an environment with obstacles, Rescaling Algorithms for Linear Conic Feasibility, A method for minimizing convex functions based on continuous approximations to the subdifferential, Simplicial decomposition in nonlinear programming algorithms, Unnamed Item, A multidimensional descent method for global optimization, A competitive solution for cooperative truckload delivery, Geometric Rescaling Algorithms for Submodular Function Minimization, A subgradient algorithm for certain minimax and minisum problems, Essentials of numerical nonsmooth optimization, The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential, Method of conditional ?-subgradient for solving convex programming problems, Distance between the fractional Brownian motion and the space of adapted Gaussian martingales, Least distance methods for the scheme of polytopes, A stable method for solving certain constrained least squares problems, An algorithm for least distance programming, A critical index algorithm for nearest point problems on simplicial cones, Essentials of numerical nonsmooth optimization, The maximal-density mass function for primordial black hole dark matter, An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, Zonotopes and the LP-Newton method, Solving \(0/1\) integer programs with enumeration cutting planes, On Poljak's improved subgradient method, 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, A neural network measuring the intersection of \(m\)-dimensional convex polyhedra, An ODE-based approach to nonlinearly constrained minimax problems, The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set, Least distance methods for the frame of homogeneous equation systems, Computing deep facet-defining disjunctive cuts for mixed-integer programming, Improving feasible directions for a class of nondifferentiable functions, Finding the projection on a polytope: An iterative method, Separating plane algorithms for convex optimization, Rescaled Coordinate Descent Methods for Linear Programming, Single-projection procedure for linear optimization, An analytical solution to the minimum \(L_ p\)-norm of a hyperplane, Approximate solution of Hamilton-Jacobi inequality by neural networks, A regularized decomposition method for minimizing a sum of polyhedral functions, Descent methods for quasidifferentiable minimization, Central axes and peripheral points in high dimensional directional datasets, A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods, Smallest point of a polytope, Minimizing pseudoconvex functions on convex compact sets, A maximum \(L_p\) distance problem, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Equivalence of convex minimization problems over base polytopes, Unnamed Item, 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, An effective nonsmooth optimization algorithm for locally Lipschitz functions, Convex quadratic programming with one constraint and bounded variables, Using the ?-subgradient method to solve the dual and the primal mathematical programming problems, Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem, Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping, Fixed point optimization algorithm and its application to power control in CDMA data networks, The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes, Activity preserving graph simplification, Theory of Principal Partitions Revisited, Method of successive projections for finding a common point of sets in metric spaces, Linear classifier and projection onto a polytope, Reflections on generating (disjunctive) cuts, The LP-Newton method for standard form linear programming problems, Extension of the LP-Newton method to conic programming problems via semi-infinite representation, A survey on the continuous nonlinear resource allocation problem, An augmented subgradient method for minimizing nonsmooth DC functions, The colourful feasibility problem, Discrete gradient method: Derivative-free method for nonsmooth optimization, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, Exterior point algorithms for nearest points and convex quadratic programs, An illumination problem: optimal apex and optimal orientation for a cone of light, A gravitational interior point method for LP., A simple projection algorithm for linear programming problems, Combination of the hybrid steepest-descent method and the viscosity approximation, A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes, The nearest point problem in a polyhedral set and its extensions, Codifferential method for minimizing nonsmooth DC functions, An active index algorithm for the nearest point problem in a polyhedral cone, An aggregate subgradient method for nonsmooth convex minimization, An algorithm for the estimation of a regression function by continuous piecewise linear functions, Efficient computation of the Hausdorff distance between polytopes by exterior random covering, The distance between two convex sets, Robust budget allocation via continuous submodular functions, A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping, The distance between convex sets with Minkowski sum structure: application to collision detection, Two-direction subgradient method for non-differentiable optimization problems, Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils, The steepest descent gravitational method for linear programming, Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets, Unnamed Item, 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, A modified quasisecant method for global optimization, Finding the closest point to the origin in the convex hull of a discrete set of points, Linearly constrained estimation by mathematical programming, A projected gradient method for optimization over density matrices, 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, Convergence of \(r\)-algorithms, A difference of convex optimization algorithm for piecewise linear regression, An algorithm for linear least squares problems with equality and nonnegativity constraints, An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set, An approximate algorithm for computing multidimensional convex hulls, Variable metric methods for linearly constrained nonlinear minimax approximation, Design of the best linear classifier for box-constrained data sets, Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization, On a space extension algorithm for nondifferentiable optimization, An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\), A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\), Stabilizing control design for state-dependent impulsive dynamical linear systems, Performance analysis of greedy algorithms for minimising a maximum mean discrepancy, A compact variable metric algorithm for nonlinear minimax approximation, 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, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases, CP-rays in simplicial cones, Gauss-Seidel method for least-distance problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- Finding the Point of a Polyhedron Closest to the Origin
- Linear and Nonlinear Separation of Patterns by Linear Programming
- An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
