On the public citation graph
Finding the nearest point in A polytope
0 signed · 303 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/bf01681343openalex-snapshot
A finite algorithm to maximize certain pseudoconcave functions on polytopes
inferredcites →https://doi.org/10.1007/bfb0121249openalex-snapshot
Algorithm for a least-distance programming problem
inferredcites →https://doi.org/10.1090/s0025-5718-1976-0394439-5openalex-snapshot
A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
inferredcites →https://doi.org/10.1137/0304007openalex-snapshot
An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
inferredcites →https://doi.org/10.1137/0307030openalex-snapshot
An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
inferredcites →https://doi.org/10.1137/0312003openalex-snapshot
Finding the Point of a Polyhedron Closest to the Origin
inferredcites →https://doi.org/10.1287/opre.13.3.444openalex-snapshot
Linear and Nonlinear Separation of Patterns by Linear Programming
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.21236/ad0700923openalex-snapshot
LINEAR LEAST SQUARES AND QUADRATIC PROGRAMMING
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cem.2625openalex-snapshot
Distance algorithm based procedure for non‐negative least squares
inferred← citeshttps://doi.org/10.1002/ecjc.1028openalex-snapshot
Approximation of inverse system (many‐valued function) by neural network
inferred← citeshttps://doi.org/10.1002/rob.4620100204openalex-snapshot
Joint trajectory generation for redundant robots in an environment with obstacles
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5453openalex-snapshot
An Analytical Solution to the MinimumLp-Norm of a Hyperplane
inferred← citeshttps://doi.org/10.1007/11790853_21openalex-snapshot
Derivative Free Stochastic Discrete Gradient Method with Adaptive Mutation
inferred← citeshttps://doi.org/10.1007/3-540-44863-2_58openalex-snapshot
Parallelization of the Discrete Gradient Method of Non-smooth Optimization and Its Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_117openalex-snapshot
Derivative-Free Methods for Non-smooth Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-89496-6_8openalex-snapshot
Algorithms of Quasidifferentiable Optimization for the Separation of Point Sets
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_2openalex-snapshot
A Monotonous Method for Unconstrained Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3285-5_8openalex-snapshot
Minimization Methods for One Class of Nonsmooth Functions and Calculation of Semi-Equilibrium Prices
inferred← citeshttps://doi.org/10.1007/978-1-4615-9552-6_7openalex-snapshot
Generalized Nyquist Tests for Robust Stability: Frequency Domain Generalizations of Kharitonov’s Theorem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_2openalex-snapshot
Numerical Methods for Minimizing Quasidifferentiable Functions: A Survey and Comparison
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_10openalex-snapshot
Some Techniques for Finding the Search Direction in Nonsmooth Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_20openalex-snapshot
Basics of Minimax Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-87809-2_9openalex-snapshot
Design of the Best Linear Classifier for Box-Constrained Data Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-91059-4_4openalex-snapshot
Row-Oriented Decomposition in Large-Scale Linear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_11openalex-snapshot
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-66431-1_16openalex-snapshot
Sampling vs. Metasampling Based on Straightforward Hilbert Representation of Isolation Kernel
inferred← citeshttps://doi.org/10.1007/978-3-031-90606-0_7openalex-snapshot
Rethinking Linear Programming: A New Finite-Termination LP-Newton Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_3openalex-snapshot
Rescaled Coordinate Descent Methods for Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_7openalex-snapshot
Theory of Principal Partitions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4openalex-snapshot
Iterative Methods for Fixed Point Problems in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4_3openalex-snapshot
Convergence of Iterative Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4_4openalex-snapshot
Algorithmic Projection Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-68619-1_102openalex-snapshot
Least Distance Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-72672-9_13openalex-snapshot
Ein Verfahren zur Lösung des Least Distance Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-22587-5_12openalex-snapshot
Pairwise Comparisons in Decision Support for Multi-Criteria Choice Problems
inferred← citeshttps://doi.org/10.1007/978-94-009-1413-1_32openalex-snapshot
Minimax Algorithms for Structural Optimization
inferred← citeshttps://doi.org/10.1007/978-94-017-7318-8_12openalex-snapshot
Hybrid Method of Discrete Gradient with Simulated Annealing or Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/bf00933376openalex-snapshot
Algorithmic equivalence in quadratic programming, I: A least-distance programming problem
inferred← citeshttps://doi.org/10.1007/bf00934744openalex-snapshot
On a space extension algorithm for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf00938486openalex-snapshot
A finite algorithm for finding the projection of a point onto the canonical simplex of ? n
inferred← citeshttps://doi.org/10.1007/bf00938545openalex-snapshot
On Poljak's improved subgradient method
inferred← citeshttps://doi.org/10.1007/bf00939646openalex-snapshot
Method of successive projections for finding a common point of sets in metric spaces
inferred← citeshttps://doi.org/10.1007/bf00940488openalex-snapshot
Gauss-seidel method for least-distance problems
inferred← citeshttps://doi.org/10.1007/bf00941156openalex-snapshot
Minimizing pseudoconvex functions on convex compact sets
inferred← citeshttps://doi.org/10.1007/bf01068618openalex-snapshot
Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01068809openalex-snapshot
Method of conditional ?-subgradient for solving convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01070129openalex-snapshot
Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
inferred← citeshttps://doi.org/10.1007/bf01074717openalex-snapshot
Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
inferred← citeshttps://doi.org/10.1007/bf01416243openalex-snapshot
Novel approaches to the discrimination problem
inferred← citeshttps://doi.org/10.1007/bf01432655openalex-snapshot
Error bounds for solutions of linear equations and inequalities
inferred← citeshttps://doi.org/10.1007/bf01443620openalex-snapshot
Descent methods for quasidifferentiable minimization
inferred← citeshttps://doi.org/10.1007/bf01580883openalex-snapshot
A regularized decomposition method for minimizing a sum of polyhedral functions
inferred← citeshttps://doi.org/10.1007/bf01581078openalex-snapshot
Exterior point algorithms for nearest points and convex quadratic programs
inferred← citeshttps://doi.org/10.1007/bf01582105openalex-snapshot
A stable method for solving certain constrained least squares problems
inferred← citeshttps://doi.org/10.1007/bf01582149openalex-snapshot
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
inferred← citeshttps://doi.org/10.1007/bf01583789openalex-snapshot
A critical index algorithm for nearest point problems on simplicial cones
inferred← citeshttps://doi.org/10.1007/bf01584232openalex-snapshot
An algorithm for linear least squares problems with equality and nonnegativity constraints
inferred← citeshttps://doi.org/10.1007/bf01584323openalex-snapshot
Simplicial decomposition in nonlinear programming algorithms
inferred← citeshttps://doi.org/10.1007/bf01585760openalex-snapshot
A note on the strong polynomiality of convex quadratic programming
inferred← citeshttps://doi.org/10.1007/bf01608995openalex-snapshot
Least distance methods for the scheme of polytopes
inferred← citeshttps://doi.org/10.1007/bf01609012openalex-snapshot
A subgradient algorithm for certain minimax and minisum problems
inferred← citeshttps://doi.org/10.1007/bf01933597openalex-snapshot
An algorithm for least distance programming
inferred← citeshttps://doi.org/10.1007/bf02085635openalex-snapshot
Solving 0/1 integer programs with enumeration cutting planes
inferred← citeshttps://doi.org/10.1007/bf02096256openalex-snapshot
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
inferred← citeshttps://doi.org/10.1007/bf02143925openalex-snapshot
An ODE-based approach to nonlinearly constrained minimax problems
inferred← citeshttps://doi.org/10.1007/bf02240210openalex-snapshot
A compact variable metric algorithm for nonlinear minimax approximation
inferred← citeshttps://doi.org/10.1007/bf02242138openalex-snapshot
Variable metric methods for linearly constrained nonlinear minimax approximation
inferred← citeshttps://doi.org/10.1007/bf02282059openalex-snapshot
An interior point algorithm for large scale portfolio optimization
inferred← citeshttps://doi.org/10.1007/bf02367719openalex-snapshot
A general method of finding the direction of descent in ε-subgradient methods
inferred← citeshttps://doi.org/10.1007/bf02591907openalex-snapshot
An aggregate subgradient method for nonsmooth convex minimization
inferred← citeshttps://doi.org/10.1007/bf02591992openalex-snapshot
Convex quadratic programming with one constraint and bounded variables
inferred← citeshttps://doi.org/10.1007/bf02614389openalex-snapshot
Separating plane algorithms for convex optimization
inferred← citeshttps://doi.org/10.1007/bf03167224openalex-snapshot
An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
inferred← citeshttps://doi.org/10.1007/bf03167575openalex-snapshot
A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
inferred← citeshttps://doi.org/10.1007/bf03398711openalex-snapshot
A Gravitational Interior Point Method for LP
inferred← citeshttps://doi.org/10.1007/bfb0121012openalex-snapshot
Submodular systems and related topics
inferred← citeshttps://doi.org/10.1007/s00245-019-09567-0openalex-snapshot
Robust Budget Allocation Via Continuous Submodular Functions
inferred← citeshttps://doi.org/10.1007/s00291-015-0394-yopenalex-snapshot
A competitive solution for cooperative truckload delivery
inferred← citeshttps://doi.org/10.1007/s00453-018-0436-3openalex-snapshot
A Simple Projection Algorithm for Linear Programming Problems
inferred← citeshttps://doi.org/10.1007/s10107-008-0245-6openalex-snapshot
Computing deep facet-defining disjunctive cuts for mixed-integer programming
inferred← citeshttps://doi.org/10.1007/s10107-010-0427-xopenalex-snapshot
Fixed point optimization algorithm and its application to power control in CDMA data networks
inferred← citeshttps://doi.org/10.1007/s10107-013-0741-1openalex-snapshot
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
inferred← citeshttps://doi.org/10.1007/s10107-018-1248-6openalex-snapshot
Submodular functions: from discrete to continuous domains
inferred← citeshttps://doi.org/10.1007/s10107-024-02077-0openalex-snapshot
An update-and-stabilize framework for the minimum-norm-point problem
inferred← citeshttps://doi.org/10.1007/s10107-025-02271-8openalex-snapshot
Frank-Wolfe meets Shapley-Folkman: a systematic approach for solving nonconvex separable problems with linear constraints
inferred← citeshttps://doi.org/10.1007/s10288-019-00425-xopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10288-021-00493-yopenalex-snapshot
Frank–Wolfe and friends: a journey into projection-free first-order optimization methods
inferred← citeshttps://doi.org/10.1007/s10479-021-04498-yopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10479-024-06251-7openalex-snapshot
Frank–Wolfe and friends: a journey into projection-free first-order optimization methods
inferred← citeshttps://doi.org/10.1007/s10559-020-00264-3openalex-snapshot
Linear Classifier and Projection Onto a Polytope*
inferred← citeshttps://doi.org/10.1007/s10589-005-4560-zopenalex-snapshot
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering
inferred← citeshttps://doi.org/10.1007/s10589-008-9174-9openalex-snapshot
An algorithm for the estimation of a regression function by continuous piecewise linear functions
inferred← citeshttps://doi.org/10.1007/s10589-009-9303-0openalex-snapshot
An active index algorithm for the nearest point problem in a polyhedral cone
inferred← citeshttps://doi.org/10.1007/s10589-011-9448-5openalex-snapshot
The nearest point problem in a polyhedral set and its extensions
inferred← citeshttps://doi.org/10.1007/s10589-014-9724-2openalex-snapshot
Central axes and peripheral points in high dimensional directional datasets
inferred← citeshttps://doi.org/10.1007/s10589-019-00124-7openalex-snapshot
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
inferred← citeshttps://doi.org/10.1007/s10589-020-00211-0openalex-snapshot
The distance between convex sets with Minkowski sum structure: application to collision detection
inferred← citeshttps://doi.org/10.1007/s10589-021-00304-4openalex-snapshot
An augmented subgradient method for minimizing nonsmooth DC functions
inferred← citeshttps://doi.org/10.1007/s10601-007-9037-5openalex-snapshot
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
inferred← citeshttps://doi.org/10.1007/s10618-013-0328-8openalex-snapshot
Activity preserving graph simplification
inferred← citeshttps://doi.org/10.1007/s10898-010-9569-xopenalex-snapshot
Codifferential method for minimizing nonsmooth DC functions
inferred← citeshttps://doi.org/10.1007/s10898-013-0071-0openalex-snapshot
An illumination problem: optimal apex and optimal orientation for a cone of light
inferred← citeshttps://doi.org/10.1007/s10898-015-0337-9openalex-snapshot
Single-projection procedure for linear optimization
inferred← citeshttps://doi.org/10.1007/s10898-026-01627-4openalex-snapshot
A truncated $$\varepsilon $$-subdifferential method for global DC optimization
inferred← citeshttps://doi.org/10.1007/s10957-007-9335-5openalex-snapshot
Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/s10957-008-9463-6openalex-snapshot
Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of a Nonexpansive Mapping
inferred← citeshttps://doi.org/10.1007/s10957-012-0024-7openalex-snapshot
An Effective Nonsmooth Optimization Algorithm for Locally Lipschitz Functions
inferred← citeshttps://doi.org/10.1007/s10957-013-0397-2openalex-snapshot
Combination of the Hybrid Steepest-Descent Method and the Viscosity Approximation
inferred← citeshttps://doi.org/10.1007/s11075-015-0034-2openalex-snapshot
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s11075-020-00933-6openalex-snapshot
Extension of the LP-Newton method to conic programming problems via semi-infinite representation
inferred← citeshttps://doi.org/10.1007/s11081-008-9067-xopenalex-snapshot
Zonotopes and the LP-Newton method
inferred← citeshttps://doi.org/10.1007/s11222-022-10184-1openalex-snapshot
Performance analysis of greedy algorithms for minimising a Maximum Mean Discrepancy
inferred← citeshttps://doi.org/10.1007/s13160-012-0083-zopenalex-snapshot
Equivalence of convex minimization problems over base polytopes
inferred← citeshttps://doi.org/10.1007/s13160-012-0085-xopenalex-snapshot
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
inferred← citeshttps://doi.org/10.1007/s13160-022-00511-4openalex-snapshot
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
inferred← citeshttps://doi.org/10.1007/s13675-012-0006-4openalex-snapshot
Reflections on generating (disjunctive) cuts
inferred← citeshttps://doi.org/10.1007/s40305-022-00447-zopenalex-snapshot
Variable Metric Method for Unconstrained Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1007/s40314-024-02992-0openalex-snapshot
Efficient methods for verifying monotonicity of 2-additive fuzzy measures
inferred← citeshttps://doi.org/10.1016/0005-1098(95)98481-kopenalex-snapshot
A neural network measuring the intersection of m-dimensional convex polyhedra
inferred← citeshttps://doi.org/10.1016/0041-5553(80)90270-0openalex-snapshot
Unified approach to solving unconstrained minimization problems
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90002-4openalex-snapshot
The steepest descent gravitational method for linear programming
inferred← citeshttps://doi.org/10.1016/0167-6377(87)90008-3openalex-snapshot
Two-direction subgradient method for non-differentiable optimization problems
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90019-1openalex-snapshot
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90080-3openalex-snapshot
Finding the closest point to the origin in the convex hull of a discrete set of points
inferred← citeshttps://doi.org/10.1016/0377-0427(86)90075-0openalex-snapshot
An aggregate subgradient method for nonsmooth and nonconvex minimization
inferred← citeshttps://doi.org/10.1016/0377-0427(87)90192-0openalex-snapshot
Least distance methods for the frame of homogeneous equation systems
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90460-2openalex-snapshot
Improving feasible directions for a class of nondifferentiable functions
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90437-2openalex-snapshot
Linearly constrained estimation by mathematical programming
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90064-7openalex-snapshot
Pseudoconvex optimization for a special problem of paint industry
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00164-2openalex-snapshot
Finding the projection on a polytope: An iterative method
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50021-5openalex-snapshot
POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING11Research effort partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute…
inferred← citeshttps://doi.org/10.1016/j.amc.2011.01.005openalex-snapshot
Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
inferred← citeshttps://doi.org/10.1016/j.apm.2017.06.033openalex-snapshot
A modified quasisecant method for global optimization
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110681openalex-snapshot
Stabilizing control design for state-dependent impulsive dynamical linear systems
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.016openalex-snapshot
The colourful feasibility problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.12.006openalex-snapshot
A survey on the continuous nonlinear resource allocation problem
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.11.591openalex-snapshot
Design and Input Allocation for Robots with Saturated Inputs via Genetic Algorithms
inferred← citeshttps://doi.org/10.1016/j.jtbi.2011.02.012openalex-snapshot
Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils
inferred← citeshttps://doi.org/10.1016/j.knosys.2014.08.028openalex-snapshot
Three types of monotonicity of averaging functions
inferred← citeshttps://doi.org/10.1016/j.laa.2006.03.022openalex-snapshot
The distance between two convex sets
inferred← citeshttps://doi.org/10.1016/j.na.2009.01.133openalex-snapshot
Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
inferred← citeshttps://doi.org/10.1016/j.neucom.2015.05.103openalex-snapshot
Efficient Lasso training from a geometrical perspective
inferred← citeshttps://doi.org/10.1016/j.orl.2013.05.004openalex-snapshot
The LP-Newton method for standard form linear programming problems
inferred← citeshttps://doi.org/10.1016/j.patcog.2015.11.011openalex-snapshot
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
inferred← citeshttps://doi.org/10.1016/j.segan.2024.101363openalex-snapshot
A novel interval estimation framework for wind power forecasting using multi-objective gradient descent optimization
inferred← citeshttps://doi.org/10.1016/j.trc.2025.105344openalex-snapshot
Reconstructing physics-informed machine learning for traffic flow modeling: a multi-gradient descent and pareto learning approach
inferred← citeshttps://doi.org/10.1016/s0096-3003(96)00053-7openalex-snapshot
Approximate solution of Hamilton-Jacobi inequality by neural networks
inferred← citeshttps://doi.org/10.1016/s0096-3003(97)10043-1openalex-snapshot
An approximate algorithm for computing multidimensional convex hulls
inferred← citeshttps://doi.org/10.1016/s0165-1684(98)00244-8openalex-snapshot
Chebyshev digital FIR filter design
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)85008-7openalex-snapshot
An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12007-6openalex-snapshot
Submodular Function Minimization
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)57935-5openalex-snapshot
Numerical Experience with Parallel Algorithms for Solving the BMI Problem
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80028-8openalex-snapshot
The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1023/a:1004666028951openalex-snapshot
An Algorithm for Solving the Minimum-Norm Point Problem over the Intersection of a Polytope and an Affine Set
inferred← citeshttps://doi.org/10.1023/a:1014075113874openalex-snapshot
A method of truncated codifferential with application to some problems of cluster analysis
inferred← citeshttps://doi.org/10.1023/a:1023227716953openalex-snapshot
Continuous Subdifferential Approximations and Their Applications
inferred← citeshttps://doi.org/10.1023/a:1024755315702openalex-snapshot
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
inferred← citeshttps://doi.org/10.1051/ro/1988220403471openalex-snapshot
Fast projection method for a special class of polytopes with applications
inferred← citeshttps://doi.org/10.1080/00207160.2017.1283414openalex-snapshot
The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set
inferred← citeshttps://doi.org/10.1080/02331930500096155openalex-snapshot
An algorithm for minimizing clustering functions
inferred← citeshttps://doi.org/10.1080/02331930600816353openalex-snapshot
Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization
inferred← citeshttps://doi.org/10.1080/02331930701762829openalex-snapshot
A subgradient-type method for the equilibrium problem over the fixed point set and its applications
inferred← citeshttps://doi.org/10.1080/02331930902884158openalex-snapshot
A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
inferred← citeshttps://doi.org/10.1080/02331930902943483openalex-snapshot
A multidimensional descent method for global optimization
inferred← citeshttps://doi.org/10.1080/02331934.2017.1339702openalex-snapshot
A trust region method for solving linearly constrained locally Lipschitz optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2024.2314241openalex-snapshot
An inexact proximal linearized DC algorithm with provably terminating inner loop
inferred← citeshttps://doi.org/10.1080/10556780290027837openalex-snapshot
A Method for Minimization of Quasidifferentiable Functions
inferred← citeshttps://doi.org/10.1080/10556780903151565openalex-snapshot
A quasisecant method for minimizing nonsmooth functions
inferred← citeshttps://doi.org/10.1080/10556788.2015.1082105openalex-snapshot
A projected gradient method for optimization over density matrices
inferred← citeshttps://doi.org/10.1080/10556789808805683openalex-snapshot
A method for minimizing convex functions based on continuous approximations to the subdifferential
inferred← citeshttps://doi.org/10.1088/1475-7516/2018/04/007openalex-snapshot
The maximal-density mass function for primordial black hole dark matter
inferred← citeshttps://doi.org/10.1088/1757-899x/158/1/012033openalex-snapshot
Solving of variational inequalities by reducing to the linear complementarity problem
inferred← citeshttps://doi.org/10.1090/s0025-5718-1976-0394439-5openalex-snapshot
A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
inferred← citeshttps://doi.org/10.1109/5.214546openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/56.2083openalex-snapshot
A fast procedure for computing the distance between complex objects in three-dimensional space
inferred← citeshttps://doi.org/10.1109/56.769openalex-snapshot
Task-oriented optimal grasping by multifingered robot hands
inferred← citeshttps://doi.org/10.1109/72.471366openalex-snapshot
Collision identification between convex polyhedra using neural networks
inferred← citeshttps://doi.org/10.1109/72.822516openalex-snapshot
A fast iterative nearest point algorithm for support vector machine classifier design
inferred← citeshttps://doi.org/10.1109/acc.1994.751863openalex-snapshot
Biaffine matrix inequality properties and computational methods
inferred← citeshttps://doi.org/10.1109/cdc.1985.268837openalex-snapshot
Minimum time robot path planning in the presence of obstacles
inferred← citeshttps://doi.org/10.1109/cdc.1988.194364openalex-snapshot
Graphical stability robustness tests for linear time-invariant systems: generalizations of Kharitonov's stability theorem
inferred← citeshttps://doi.org/10.1109/cdc.1989.70619openalex-snapshot
Numerical experiment with new conjugate direction methods for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1109/cdc.1993.325828openalex-snapshot
A feasible directions type algorithm for optimal control problems with hard state and control constraints
inferred← citeshttps://doi.org/10.1109/cdc.1994.411714openalex-snapshot
An algorithm for a general minimum fuel control problem
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582527openalex-snapshot
A Proximity Algorithm for Support Vector Machine Classification
inferred← citeshttps://doi.org/10.1109/cec.2003.1299608openalex-snapshot
The discrete gradient evolutionary strategy method for global optimization
inferred← citeshttps://doi.org/10.1109/cnsa.2017.7973958openalex-snapshot
Solving of a projection problem for convex polyhedra given by a system of linear constraints
inferred← citeshttps://doi.org/10.1109/cvpr.2016.579openalex-snapshot
Min Norm Point Algorithm for Higher Order MRF-MAP Inference
inferred← citeshttps://doi.org/10.1109/globalsip.2017.8309023openalex-snapshot
Decentralized bundle method for nonsmooth consensus optimization
inferred← citeshttps://doi.org/10.1109/icassp.1991.151014openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/icra.2017.7989014openalex-snapshot
Fast second-order cone programming for safe mission planning
inferred← citeshttps://doi.org/10.1109/icrc60800.2023.10386971openalex-snapshot
Optimal Clifford Initial States for Ising Hamiltonians
inferred← citeshttps://doi.org/10.1109/ieeeconf56349.2022.10052065openalex-snapshot
Hypergraph 1-Spectral Clustering with General Submodular Weights
inferred← citeshttps://doi.org/10.1109/ijcnn.1999.832720openalex-snapshot
Design of neural stabilizing controller for nonlinear systems via Lyapunov's direct method
inferred← citeshttps://doi.org/10.1109/isit.2013.6620475openalex-snapshot
Towards combinatorial LP turbo decoding
inferred← citeshttps://doi.org/10.1109/mlsp.2014.6958914openalex-snapshot
Exact SVM training by Wolfe's minimum norm point algorithm
inferred← citeshttps://doi.org/10.1109/mwscas.1994.518974openalex-snapshot
Constrained min-max optimization of multi-rate digital filters with simultaneous magnitude and group-delay specifications
showing the first 200 of 291 · page through all 291
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.