Results 31 to 40 of about 1,804,722 (202)
Abstract convexity for nonconvex optimization duality
, 2007 In this article, we use abstract convexity results to study augmented dual problems for (nonconvex) constrained optimization problems. We consider a nonincreasing function f that is lower semicontinuous at 0 and establish its abstract convexity at 0 with
Ozdaglar, A., Rubinov, Alex, Nedic, A.
core +1 more source
Replication Data for: eSLP optimization algorithm
, 2023 m-files implementing the eSLP optimization algorithm for the three simulations (3.1. - 3.3.) described in the associated paper. File README.txt contains analytical directions regarding requirements, how to verify the results and videos generated by the ...
Optimization, eSLP
core +1 more source
An ADMM-based heuristic algorithm for optimization problems over nonconvex second-order cone
Open Computer ScienceThe nonconvex second-order cone (nonconvex SOC) is a nonconvex extension to the convex second-order cone, in the sense that it consists of any vector divided into two sub-vectors for which the Euclidean norm of the first sub-vector is at least as large ...
Alzalg Baha, Benakkouche Lilia
doaj +1 more source
Nonconvex Penalized Regularization for Robust Sparse Recovery in the Presence of
IEEE Access, 2018 Nonconvex penalties have recently received considerable attention in sparse recovery based on Gaussian assumptions. However, many sparse recovery problems occur in the presence of impulsive noises. This paper is concerned with the analysis and comparison
Yunyi Li +5 more
doaj +1 more source
Efficient and Robust Standing Postures of Quadruped Robots
Advanced Robotics Research, EarlyView.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
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
Advanced Robotics Research, EarlyView.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
On the relationship between bilevel decomposition algorithms and direct interior-point methods [PDF]
, 2004 Engineers have been using bilevel decomposition algorithms to solve certain nonconvex large-scale optimization problems arising in engineering design projects.
Miguel, Angel Víctor de +1 more
core +1 more source
Доповiдi Нацiональної академiї наук УкраїниThe paper observes the similarity between the stochastic optimal control over discrete dynamical systems and the lear ning multilayer neural networks. It focuses on contemporary deep networks with nonconvex nonsmooth loss and activation functions.
V.I. Norkin
doaj +1 more source
A Global Optimization Algorithm for Generalized Quadratic Programming
Journal of Applied Mathematics, 2013 We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints.
Hongwei Jiao, Yongqiang Chen
doaj +1 more source
Nonconvex Vector Optimization and Optimality Conditions for Proper Efficiency
International Journal of Analysis and Applications, 2022 In this paper, we consider, a new nonlinear scalarization function in vector spaces which is a generalization of the oriented distance function. Using the algebraic type of closure, which is called vector closure, we introduce the algebraic boundary of a
E. Kiyani, S. M. Vaezpour, J. Tavakoli
doaj +1 more source