Results 31 to 40 of about 2,134,101 (207)

Non-convex mixed-integer nonlinear programming : a survey [PDF]

open access: yes, 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, Letchford, Adam
core   +4 more sources

A Note on Optimality Conditions for DC Programs Involving Composite Functions

open access: yesAbstract and Applied Analysis, 2014
By using the formula of the ε-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained.
Xiang-Kai Sun, Hong-Yong Fu
doaj   +1 more source

Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization

open access: yesJournal of Inequalities and Applications, 2019
In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization.
Q. L. Dong   +4 more
doaj   +1 more source

Convex Matroid Optimization [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2003
We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.
openaire   +3 more sources

Randomized gradient-free methods in convex optimization [PDF]

open access: yes, 2023
This review presents modern gradient-free methods to solve convex optimization problems. By gradient-free methods, we mean those that use only (noisy) realizations of the objective value.
Dvurechensky, Pavel   +5 more
core   +1 more source

ROBOTIC MOTION PLANNING USING CONVEX OPTIMIZATION METHODS

open access: yesIraqi Journal for Computers and Informatics, 2019
Collision avoidance techniques tend to derive the robot away of the obstacles in minimal total travel distance. Most of the collision avoidance algorithms have trouble get stuck in a local minimum.
Thaker Nayl
doaj   +1 more source

Some Inequalities of Generalized p-Convex Functions concerning Raina’s Fractional Integral Operators

open access: yesJournal of Mathematics, 2021
Convex functions play an important role in pure and applied mathematics specially in optimization theory. In this paper, we will deal with well-known class of convex functions named as generalized p-convex functions.
Changyue Chen   +2 more
doaj   +1 more source

Convex optimization using quantum oracles [PDF]

open access: yesQuantum, 2020
We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracles, and we examine the efficiency of reductions between the different ...
Joran van Apeldoorn   +3 more
doaj   +1 more source

Isotone Optimization in R: Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods [PDF]

open access: yes, 2009
In this paper we give a general framework for isotone optimization. First we discuss a generalized version of the pool-adjacent-violators algorithm (PAVA) to minimize a separable convex function with simple chain constraints.
de Leeuw, Jan   +6 more
core   +1 more source

Convex Optimization in R

open access: yesJournal of Statistical Software, 2014
Convex optimization now plays an essential role in many facets of statistics. We briefly survey some recent developments and describe some implementations of these methods in R .
Roger Koenker, Ivan Mizera
doaj   +1 more source

Home - About - Disclaimer - Privacy