Results 71 to 80 of about 1,804,722 (202)
Immunizing Conic Quadratic Optimization Problems Against Implementation Errors [PDF]
We show that the robust counterpart of a convex quadratic constraint with ellipsoidal implementation error is equivalent to a system of conic quadratic constraints.
Ben-Tal, A., Hertog, D. den
core
ActuatorsThis paper proposes a nonlinear model predictive control (MPC) framework initialized using an initial-guess particle swarm optimization (IG-PSO) algorithm for mobile robots navigating in environments with nonconvex obstacles.
Seung-Mok Lee
doaj +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Generalisation is a crucial aspect of deep learning, enabling models to perform well on unseen data. Currently, most optimisers that improve generalisation typically suffer from efficiency bottlenecks. This paper proposes a double‐integration‐enhanced stochastic gradient descent (DIESGD) optimiser, which treats the negative gradient as an ...
Ting Li +3 more
wiley +1 more source
High Voltage, EarlyView.ABSTRACT With the development of electric power artificial intelligence (AI) technology, many complicated challenges emerged during application. Traditional AI algorithms work well in specialised tasks such as detection and classification. However, they are unlikely to solve general problems.
Yuanpeng Tan +4 more
wiley +1 more source
A Nonsmooth, Nonconvex Model of Optimal Growth [PDF]
This paper analyzes the nature of economic dynamics in a one-sector optimal growth model in which the technology is generally nonconvex, nondifferentiable, and discontinuous. The model also allows for irreversible investment and unbounded growth.
Takashi Kamihigashi, Santanu Roy
core
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Journal of Inequalities and Applications, 2019 In this paper, we propose an inexact version of proximal gradient algorithm with extrapolation for solving a class of nonconvex nonsmooth optimization problems.
Zehui Jia, Zhongming Wu, Xiaomei Dong
doaj +1 more source
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Computer Graphics Forum, EarlyView.Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
Medial Axis Aware Learning of Signed Distance Functions
Computer Graphics Forum, EarlyView.Abstract We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher‐order variational formulation that enforces linear growth ...
Samuel Weidemaier +2 more
wiley +1 more source
Distributed nonconvex optimization over networks
, 2015 We study nonconvex distributed optimization in multi-agent networks. We introduce a novel algorithmic framework for the distributed minimization of the sum of a smooth (possibly nonconvex) function-the agents' sum-utility-plus a convex (possibly ...
Scutari G., Di Lorenzo P
core +1 more source