Results 71 to 80 of about 22,797 (304)
Optimality conditions for multiobjective symmetric convex programming
Not available.
Ştefan Ţigan
doaj +2 more sources
Midcourse Guidance via Variable-Discrete-Scale Sequential Convex Programming
To address the challenges of strong nonlinearity, stringent terminal constraints, and the trade-off between computational efficiency and accuracy in the midcourse guidance trajectory optimization problem of aerodynamically controlled interceptors, this ...
Jinlin Zhang +4 more
doaj +1 more source
This work reports on the actuation behavior of CP‐based polypyrrole/PVdF TYs soaked in electrolyte/ionic liquids and woven actuators where such TYs are integrated. These studies are important toward the creation of on‐body applications such as wearable soft robotics, where textiles offer many advantages such as increased force, integrated electrical ...
Carin Backe +4 more
wiley +1 more source
Ideal points in multiobjective programming [PDF]
The main object of this paper is to give conditions under which a minimal solution to a problem of mathematical programming can be transformed into a minimum solution in the usual sense of the order relations, or in every case, conditions under which ...
Balbás, Alejandro +2 more
core
This study combines full‐field tomography with diffraction mapping to quantify radial (ε002$\varepsilon _{002}$) and axial (ε100$\varepsilon _{100}$) lattice strain in wrinkled carbon‐fiber specimens for the first time. Radial microstrain gradients (−14.5 µεMPa$\varepsilon \mathrm{MPa}$−1) are found to signal damage‐prone zones ahead of failure, which ...
Hoang Minh Luong +7 more
wiley +1 more source
Optimizing condition numbers [PDF]
In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Maréchal, Pierre, Ye, Jane
core +1 more source
Stable Zero Lagrange Duality for DC Conic Programming
We consider the problems of minimizing a DC function under a cone-convex constraint and a set constraint. By using the infimal convolution of the conjugate functions, we present a new constraint qualification which completely characterizes the Farkas ...
D. H. Fang
doaj +1 more source
Automated VMAT treatment planning using sequential convex programming: algorithm development and clinical implementation. [PDF]
Dursun P +10 more
europepmc +1 more source
A programmable 2048‐element circular ultrasound array combined with a compact acoustic lens produces a thin “sound sheet” over a large field of view, and records echoes with wide angular diversity across the ring aperture. Coherence‐enhanced beamforming converts full‐matrix data into high‐contrast tomographic slices, delivering near‐diffraction‐limited
Qiu‐De Zhang +11 more
wiley +1 more source
Prediction and prevention of pandemics via graphical model inference and convex programming. [PDF]
Krechetov M +4 more
europepmc +1 more source

