Pages that link to "Item:Q4123085"
From MaRDI portal
The following pages link to Finding the nearest point in A polytope (Q4123085):
Displaying 50 items.
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Single-projection procedure for linear optimization (Q330507) (← links)
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem (Q419918) (← links)
- Fixed point optimization algorithm and its application to power control in CDMA data networks (Q431032) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping (Q632862) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- CP-rays in simplicial cones (Q811413) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Method of successive projections for finding a common point of sets in metric spaces (Q911469) (← links)
- The colourful feasibility problem (Q944700) (← links)
- Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Variable metric methods for linearly constrained nonlinear minimax approximation (Q1051247) (← links)
- On a space extension algorithm for nondifferentiable optimization (Q1054275) (← links)
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617) (← links)
- A compact variable metric algorithm for nonlinear minimax approximation (Q1062915) (← links)
- On Poljak's improved subgradient method (Q1090617) (← links)
- Least distance methods for the frame of homogeneous equation systems (Q1098570) (← links)
- Improving feasible directions for a class of nondifferentiable functions (Q1099079) (← links)
- Descent methods for quasidifferentiable minimization (Q1109687) (← links)
- Smallest point of a polytope (Q1117135) (← links)
- Minimizing pseudoconvex functions on convex compact sets (Q1120481) (← links)
- Finding the closest point to the origin in the convex hull of a discrete set of points (Q1260737) (← links)
- Linearly constrained estimation by mathematical programming (Q1262209) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review (Q1312749) (← links)
- An interior point algorithm for large scale portfolio optimization (Q1313173) (← links)
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes (Q1315417) (← links)
- Gauss-Seidel method for least-distance problems (Q1321271) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane (Q1342092) (← links)
- Pseudoconvex optimization for a special problem of paint industry (Q1342653) (← links)
- Finding the projection on a polytope: An iterative method (Q1352784) (← links)
- Separating plane algorithms for convex optimization (Q1356051) (← links)
- An analytical solution to the minimum \(L_ p\)-norm of a hyperplane (Q1363554) (← links)
- Approximate solution of Hamilton-Jacobi inequality by neural networks (Q1363819) (← links)
- A maximum \(L_p\) distance problem (Q1378646) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- A simple projection algorithm for linear programming problems (Q1755785) (← links)
