Results 251 to 260 of about 904,011 (327)
Anatomical relationship between the intertrochanteric line and femoral neck osteotomy level in direct anterior approach total hip arthroplasty: a 3D morphometric and cadaveric validation study. [PDF]
ArthroplastyLimmahakhun S +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cutting-plane method based on epigraph approximation with discarding the cutting planes
Automation and Remote Control, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zabotin I., Yarullin R.
openaire +5 more sources
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
Journal of Optimization Theory and Applications, 2010The authors propose an algorithm for solving nonsmooth nonconvex unconstrained programming problems together with some convergence results. This algorithm generates a sequence of interior points of the epigraph of the objective function whose accumulation points are stationary points of the original problem, and so, in case the objective is convex ...
Karmitsa, Napsu +2 more
openaire +2 more sources
On Vaidya's Volumetric Cutting Plane Method for Convex Programming
Mathematics of Operations Research, 1997We describe a simplified and strengthened version of Vaidya's volumetric cutting plane method for finding a point in a convex set 𝒞 ⊂ Rn. At each step the algorithm has a system of linear inequality constraints which defines a polyhedron 𝒫 ⊃ 𝒞, and an interior point x ∈ 𝒫.
K. Anstreicher
openaire +3 more sources
Cutting Plane Method for Continuously Constrained Kernel-Based Regression
IEEE Transactions on Neural Networks, 2010Incorporating constraints into the kernel-based regression is an effective means to improve regression performance. Nevertheless, in many applications, the constraints are continuous with respect to some parameters so that computational difficulties arise. Discretizing the constraints is a reasonable solution for these difficulties.
Zhe, Sun +3 more
openaire +3 more sources
The Cutting-Plane Method for Solving Convex Programs
Journal of the Society for Industrial and Applied Mathematics, 1960J. E. Kelley
openaire +3 more sources
An exact cutting plane method for k-submodular function maximization
Discrete Optimization, 2020A natural and important generalization of submodularity -- $k$-submodularity -- applies to set functions with $k$ arguments and appears in a broad range of applications, such as infrastructure design, machine learning, and healthcare.
Qimeng Yu, Simge Küçükyavuz
semanticscholar +1 more source
A cutting-plane method to nonsmooth multiobjective optimization problems
European Journal of Operational Research, 2019The cutting-plane optimization methods rely on the idea that any subgradient of the objective function or the active/violated constraints defines a halfspace to be excluded from a set that contains an optimal solution: the localizing set.
D. Vieira, A. C. Lisboa
semanticscholar +1 more source