Simulation and Optimization of Logistic Processes Involving Sloshing Media

Leonpacher, Harald; Douglas, Steven; Woolley, N. H.; Kraft, Dieter

doi:10.1007/978-3-642-60155-2_18

Lecture Notes in Computational Science and Engineering

1999

DOI: 10.1007/978-3-642-60155-2_18

|View full text |Cite

Simulation and Optimization of Logistic Processes Involving Sloshing Media

Harald Leonpacher¹,

Steven Douglas

N. H. Woolley

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

Initialization of the difference of convex functions optimization algorithm for nonconvex quadratic problems

Achour,

Rahmoune,

Ouchenane

et al. 2024

Filomat

View full text Add to dashboard Cite

The Difference of Convex functions Algorithm (DCA) is used to solve nonconvex optimization problems over a certain convex set, specifically quadratic programming ones, generally by finding approximate solutions. DCA efficiency depends on two basic parameters that directly affect the speed of its convergence towards the optimal solution. The first parameter is the selected decomposition and the second is the assigned initial point. The aim of this study was to create a new algorithm that allows overcoming the need for a pre-selected initial estimate of the DCA. To achieve this aim, we performed an experimental study with 107 test problems using an implementation framework with MATLAB. Assessment was based on key performance indicators: (a) the time required to reach the initial point and solution and (b) the number of iterations. We selected three initial points, the first (xlin 0) is the minimum of the linear part of the nonconvex quadratic problem (NCQP), the second (xcvx 0) is the approximate global minimum of the convex part, and the third (xcve 0) is the approximate global minimum of the concave part. We compared between the minimuma computed by DCA for each of the three initial estimates. The results demonstrated clear advantage of the DCA algorithm with (xlin 0). Based on this outcome, we constructed a novel algorithm called Initialized DCA (IDCA) that allows implementation of the DCA with the best initial estimate without the requirement for a pre-determined initial point.

show abstract

Initialization of the difference of convex functions optimization algorithm for nonconvex quadratic problems

Achour,

Rahmoune,

Ouchenane

et al. 2024

Filomat

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Simulation and Optimization of Logistic Processes Involving Sloshing Media

Cited by 1 publication

References 1 publication

Initialization of the difference of convex functions optimization algorithm for nonconvex quadratic problems

Initialization of the difference of convex functions optimization algorithm for nonconvex quadratic problems

Contact Info

Product

Resources

About