Results 81 to 90 of about 2,134,101 (207)

Convex underestimating relaxation techniques for nonconvex polynomial programming problems: computational overview

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

Inexact Tensor Methods and their Application to Stochastic Convex Optimization

, 2023
We propose general non-accelerated [The results for non-accelerated methods first appeared in December 2020 in the preprint (A. Agafonov, D. Kamzolov, P. Dvurechensky, and A.
Dvurechensky, Pavel, Agafonov, Artem, Kamzolov, Dmitry, Gasnikov, Alexander, Takáč, Martin   +4 more
core   +1 more source

First-order methods of smooth convex optimization with inexact oracle [PDF]

In this paper, we analyze different first-order methods of smooth convex optimization employing inexact first-order information. We introduce the notion of an approximate first-order oracle.
GLINEUR, François, NESTEROV, Yurii, DEVOLDER, Olivier   +2 more
core  

Sparse convex optimization toolkit: a mixed-integer framework

, 2023
This paper proposes an open-source distributed solver for solving Sparse Convex Optimization (SCO) problems over computational networks. Motivated by past algorithmic advances in mixed-integer optimization, the Sparse Convex Optimization Toolkit (SCOT ...
Camponogara, Eduardo,, Olama, Alireza,, Kronqvist, Jan,   +2 more
core   +1 more source

ON OPTIMUM DESIGN OF FRAME STRUCTURES

Acta Polytechnica CTU Proceedings, 2020
Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality ...
Marek Tyburec, Jan Zeman, Martin Kružík, Didier Henrion   +3 more
doaj   +1 more source

Duality and calculi without exceptions for convex objects [PDF]

The aim of this paper is to make a contribution to theinvestigation of the roots and essence of convex analysis, and tothe development of the duality formulas of convex calculus.
Brinkhuis, J.
core  

Optimized Temporal Interference Stimulation Based on Convex Optimization: A Computational Study

IEEE Transactions on Neural Systems and Rehabilitation Engineering
Temporal interference (TI) stimulation is a non-invasive method targeting deep brain regions by applying two pairs of high-frequency currents with a slight frequency difference to the scalp.
Chao Geng, Yang Li, Long Li, Xiaoqi Zhu, Xiaohan Hou, Tian Liu   +5 more
doaj   +1 more source

The Effect of Transformations on the Approximation of Univariate (Convex) Functions with Applications to Pareto Curves [PDF]

In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed.We study the effect of the use of increasing convex or increasing concave transformations ...
Siem, A.Y.D., Hertog, D. den, Hoffmann, A.L.   +2 more
core  

Raising Power Loss Equalizing Degree of Coil Array by Convex Quadratic Optimization Commutation for Magnetic Levitation Planar Motors

Applied Sciences, 2018
This paper proposes a convex quadratic optimization commutation method to raise the equalization degree of power loss distribution of coil array for magnetic levitation planar motors.
Shengguo Zhang, Jingtao Huang, Jingxian Yang   +2 more
doaj   +1 more source

Exploiting Higher-order Derivates in Convex Optimization Methods

, 2023
Exploiting higher-order derivatives in convex optimization is known at least since 1970's. In each iteration higher-order (also called tensor) methods minimize a regularized Taylor expansion of the objective function, which leads to faster convergence ...
Dvurechensky, Pavel, Agafonov, Artem, Kamzolov, Dmitry, Gasnikov, Alexander, Takáč, Martin   +4 more
core   +1 more source