Results 41 to 50 of about 2,777,990 (323)

An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems

open access: yesJournal of Inequalities and Applications, 2018
In this paper, we propose an alternating linearization bundle method for minimizing the sum of a nonconvex function and a convex function, both of which are not necessarily differentiable. The nonconvex function is first locally “convexified” by imposing
Chunming Tang, Jinman Lv, Jinbao Jian
doaj   +1 more source

Cutting a Bunch of Grapes by a Plane

open access: yesEuropean Journal of Combinatorics, 2001
Let \({\mathcal B}_n\) be a family of \(n\) disjoint balls in \(d\)-dimensional euclidean space \(\mathbb{R}^d\). If \(d=2\) the term disk is used in place of ball. The max-min ratio of \({\mathcal B}_n\) is the ratio \(\lambda\) of the maximum radius divided by the minimum radius among the balls of \({\mathcal B}_n\). The authors prove two interesting
Hiroshi Maehara, Ai Oshiro
openaire   +2 more sources

Experimental study of the brittle–ductile transition in hot cutting of SG iron specimens [PDF]

open access: yes, 2013
http://www.sciencedirect.com/science/article/pii/S0924013612002579The present paper investigates the brittle-ductile transition (BDT) of the primary shear zone during cutting of spheroidal graphite (SG) iron in the austenitization temperature range ...
EL MANSORI, Mohamed   +2 more
core   +1 more source

Cutting Forces Modeling in Finish Turning of Inconel 718 Alloy with Round Inserts [PDF]

open access: yes, 2011
In turning, the applied forces have to be known as accurately as possible, especially in the case of difficult-to-cut materials for aircraft workpieces finishing operations.
Gérard Poulachon   +7 more
core   +1 more source

MODELING OF ROUGH ROTARY MILLING OF CRANKSHAFT PINS [PDF]

open access: yesScientific Journal of Silesian University of Technology. Series Transport, 2023
The development of the modern automotive industry requires a quick adaptation of new production methods. This is possible thanks to software capable of simulating manufacturing processes.
Kacper CIEŚLAR, Stanisław PŁONKA
doaj   +1 more source

A Static Voltage Security Region for Centralized Wind Power Integration—Part I: Concept and Method

open access: yesEnergies, 2014
When large wind farms are centrally integrated in a power grid, cascading tripping faults induced by voltage issues are becoming a great challenge. This paper therefore proposes a concept of static voltage security region to guarantee that the voltage ...
Tao Ding   +4 more
doaj   +1 more source

Infeasibility Cutting Plane for Unit Commitment Problem

open access: yesCSEE Journal of Power and Energy Systems
This paper introduces a new type of cutting plane for the unit commitment (UC) problem, namely “infeasibility cutting plane”. The infeasibility cutting plane refers to a type of logic constraint that eliminates the combination of integer ...
Shengpeng Qu, Zhifang Yang
doaj   +1 more source

Accuracy and Technical Predictability of Computer Guided Bone Harvesting from the Mandible: A Cone-Beam CT Analysis in 22 Consecutive Patients

open access: yesJournal of Functional Biomaterials, 2022
This study assesses the accuracy and technical predictability of a computer-guided procedure for harvesting bone from the external oblique ridge using a patient-specific cutting guide.
Luca De Stavola   +6 more
doaj   +1 more source

Cutting Planes in Combinatorics

open access: yesEuropean Journal of Combinatorics, 1985
The author uses two combinatorial problems: packing diamonds into a Chinese checkerboard nd Deza's proof of a conjecture of Erdős and Lovàsz [\textit{M. Deza}, J. Comb. Theory, Ser. B, 16, 166-167 (1974; Zbl 0263.05007)] to illustrate how Gomory's cutting plane method for solving integer linear programming problems can be used to solve combinatorial ...
openaire   +3 more sources

A version of the penalty method with approximation of the epigraphs of auxiliary functions

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки, 2019
A method for solving the convex programming problem, which is ideologically close to the known methods of external penalties, was proposed. The method uses auxiliary functions that are built on the general form of the penalty functions.
I.Ya. Zabotin, K.E. Kazaeva
doaj   +1 more source

Home - About - Disclaimer - Privacy