Results 21 to 30 of about 1,091,019 (290)

Properties of Answer Set Programming with Convex Generalized Atoms [PDF]

open access: yes
In recent years, Answer Set Programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms, generalized ...
Alviano, Mario, Faber, Wolfgang
core   +3 more sources

An inexact multiblock alternating direction method for grasping-force optimization of multifingered robotic hands

open access: yesJournal of Inequalities and Applications, 2023
In this paper, we present an inexact multiblock alternating direction method for the point-contact friction model of the force-optimization problem (FOP).
Yaling Zhang, Xuewen Mu
doaj   +1 more source

Midcourse Guidance Trajectory Optimization of Interceptor Missile Based on Sequential Convex Programming [PDF]

open access: yesHangkong bingqi, 2023
Aiming at the trajectory optimization problem of interceptor midcourse guidance under strong nonlinear multi-constraint conditions, a trajectory optimization algorithm for fixed time constraints is proposed based on sequential convex programming method ...
Li Jiong, Zhang Jinlin, Shao Lei, Li Wanli, He Yangchao
doaj   +1 more source

Artificial Algae Algorithm with Multi-Light Source Movement for Economic Dispatch of Thermal Generation

open access: yesMehran University Research Journal of Engineering and Technology, 2020
Economic Dispatch (ED) is one of the major concerns for the efficient and economical operation of the modern power system. Actual ED problem is non-convex in nature due to Ramp Rate Limits (RRL), Valve-Point Loading Effects (VPLE), and Prohibited ...
Hafiz Muhammad Awais   +2 more
doaj   +1 more source

Convex Optimisation Model for Ship Speed Profile: Optimisation under Fixed Schedule

open access: yesJournal of Marine Science and Engineering, 2021
We present a novel convex optimisation model for ship speed profile optimisation under varying environmental conditions, with a fixed schedule for the journey.
Janne Huotari   +3 more
doaj   +1 more source

Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method

open access: yesInternational Journal of Aerospace Engineering, 2019
A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal ...
Chun-Mei Yu, Dang-Jun Zhao, Ye Yang
doaj   +1 more source

A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem

open access: yesAbstract and Applied Analysis, 2014
This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set.
Lin-Peng Yang   +2 more
doaj   +1 more source

A Note on Optimality Conditions for DC Programs Involving Composite Functions

open access: yesAbstract and Applied Analysis, 2014
By using the formula of the ε-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained.
Xiang-Kai Sun, Hong-Yong Fu
doaj   +1 more source

Juvenile Huntington Disease With Cerebellar‐Predominant Atrophy Identified by Genome Sequencing

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Juvenile Huntington disease accounts for a small fraction of Huntington disease cases and is driven by the largest trinucleotide repeat expansions. We describe a 6‐year‐old boy with progressive global regression, generalized dystonia, and epilepsy, in whom serial imaging showed striking cerebellar‐predominant atrophy with an initially normal ...
Enrique Gonzalez Saez‐Diez   +5 more
wiley   +1 more source

Upper bounds for packings of spheres of several radii

open access: yesForum of Mathematics, Sigma, 2014
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of
DAVID DE LAAT   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy