Results 81 to 90 of about 67,874 (310)
Tsinghua Science and Technology, 2017 We consider a wide range of non-convex regularized minimization problems, where the non-convex regularization term is composite with a linear function engaged in sparse learning.
Linbo Qiao +3 more
doaj +1 more source
Azaporphyrinoid‐Based Photo‐ and Electroactive Architectures for Advanced Functional Materials
Advanced Materials, EarlyView.A long‐standing collaboration between the Torres and Guldi groups has yielded diverse azaporphyrinoid‐based donor‐acceptor nanohybrids with promising applications in solar energy conversion. This conspectus highlights key molecular platforms and structure‐function relationships that govern light and charge management, supporting the rational design of ...
Jorge Labella +3 more
wiley +1 more source
Convex Analysis for Minimizing and Learning Submodular Set Functions [PDF]
, 2013 The connections between convexity and submodularity are explored, for purposes of minimizing and learning submodular set functions. First, we develop a novel method for minimizing a particular class of submodular functions, which can be expressed as a
Peter Stobbe, Stobbe, Peter
core +1 more source
Fuzzy convexity and multiobjective convex optimization problems
Computers & Mathematics with Applications, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Ru Syau, E. Stanley Lee
openaire +2 more sources
Advanced Materials, EarlyView.Residual magnetization induces pronounced mechanical anisotropy in ultra‐soft magnetorheological elastomers, shaping deformation and actuation even without external magnetic fields. This study introduces a computational‐experimental framework integrating magneto‐mechanical coupling into topology optimization for designing soft magnetic actuators with ...
Carlos Perez‐Garcia +3 more
wiley +1 more source
Non-convex mixed-integer nonlinear programming : a survey [PDF]
, 2012 A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S +3 more
core
Barrier Algorithms for constrained Non-Convex Optimization [PDF]
In this paper we theoretically show that interior-point methods based on self-concordant barriers possess favorable global complexity beyond their standard application area of convex optimization. To do that we propose first- and second-order methods for
Dvurechensky, Pavel, Staudigl, Mathias
core +1 more source
Space‐Time Coding Conformal Metasurfaces for Multifrequency Beam Steering and Shaping
Advanced Materials, EarlyView.Space‐time coding conformal metasurfaces enable dynamic wave control on curved surfaces by combining programmable spatial patterns with temporal modulation. This study shows that a single conformal aperture can independently manipulate multiple frequency components, achieving multifunctional beam shaping and steering, with implications for ...
Filippo Pepe +8 more
wiley +1 more source
Joint User Association and Beamforming Design for ISAC Networks With Large Language Models
IEEE Open Journal of the Communications SocietyIntegrated sensing and communication (ISAC) has been envisioned to play a more important role in future wireless networks. However, the design of ISAC networks is challenging, especially when there are multiple communication and sensing (C&S ...
Haoyun Li +5 more
doaj +1 more source
Journal of the Mechanical Behavior of Materials, 2015 This paper introduces constructing convex-relaxed programs for nonconvex optimization problems. Branch-and-bound algorithms are convex-relaxation-based techniques.
Keller André A.
doaj +1 more source