Results 31 to 40 of about 3,146 (222)
Sparse Signal Recovery via Exponential Metric Approximation
Sparse signal recovery problems are common in parameter estimation, image processing, pattern recognition, and so on. The problem of recovering a sparse signal representation from a signal dictionary might be classified as a linear constraint ℓ0 ...
Jian Pan, Jun Tang, Wei Zhu
doaj +1 more source
An Accelerating Algorithm for Linear Multiplicative Programming Problem
By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP).
Shuai Tang, Zhisong Hou, Longquan Yong
doaj +1 more source
Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
The systematic design of exact optimal designs of experiments is typically challenging, as it results in nonconvex optimization problems. The literature on the computation of model-based exact optimal designs of experiments via mathematical programming ...
Belmiro P. M. Duarte
doaj +1 more source
Efficiency and Approachability of Nonconvex Bicriteria Programs
The paper presents some characterizations of efficient and proper efficient solutions of general bicriteria optimization problems via the concepts of modified lower envelopes and approachability [\textit{M. L. Tenhuisen} and \textit{M. M. Wiecek}, J. Glob. Optim. 11, 225-251 (1997; Zbl 0903.90147)]. By using two kinds of nonlinear Lagrangian functions,
Huang, X.X., Yang, X.Q.
openaire +1 more source
Efficient and Robust Standing Postures of Quadruped Robots
A calibrated static framework estimates load, optimizes torques, and adapts posture so quadruped robots stand efficiently and robustly under external payloads, achieving up to 50% lower torque demand. Inspired by the natural posture adjustments of animals under external loading, this article presents an optimization‐based framework for minimizing joint
Mohamad Kanaan +5 more
wiley +1 more source
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
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang +5 more
wiley +1 more source
Combined heat and power dynamic economic emission dispatch (CHPDEED) problem is a complicated nonlinear constrained multiobjective optimization problem with nonconvex characteristics.
A. M. Elaiw, X. Xia, A. M. Shehata
doaj +1 more source
An ADMM-based SQP method for separably smooth nonconvex optimization
This work is about a splitting approach for solving separably smooth nonconvex linearly constrained optimization problems. Based on the ideas from two classical methods, namely the sequential quadratic programming (SQP) and the alternating direction ...
Meixing Liu, Jinbao Jian
doaj +1 more source
Multiferroic order parameters – polarization, magnetization, and ferroelastic strain – are positioned as dynamic design variables for batteries. Their mechanistic roles, practical tuning through fabrication and external fields, and ferroic‐resolved characterization routes are unified into a closed‐loop framework, revealing how coupled ferroic responses
Jiaqi Su +13 more
wiley +1 more source

