Results 31 to 40 of about 68 (67)

A hybrid approach to the solution of a pricing model with continuous demand segmentation

open access: yesEURO Journal on Computational Optimization, 2013
Price optimization fits naturally the framework of bilevel programming, where a leader integrates within its decision process the reaction of rational customers.
Patrice Marcotte   +2 more
doaj   +1 more source

Nonsmooth spectral gradient methods for unconstrained optimization

open access: yesEURO Journal on Computational Optimization, 2017
To solve nonsmooth unconstrained minimization problems, we combine the spectral choice of step length with two well-established subdifferential-type schemes: the gradient sampling method and the simplex gradient method.
Milagros Loreto   +3 more
doaj   +1 more source

On global optimization with indefinite quadratics

open access: yesEURO Journal on Computational Optimization, 2017
We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj   +1 more source

Performance Bounds For Co-/Sparse Box Constrained Signal Recovery

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
The recovery of structured signals from a few linear measurements is a central point in both compressed sensing (CS) and discrete tomography. In CS the signal structure is described by means of a low complexity model e.g. co-/sparsity.
Kuske Jan, Petra Stefania
doaj   +1 more source

Geometric approaches to matrix normalization and graph balancing

open access: yesForum of Mathematics, Sigma
Normal matrices, or matrices which commute with their adjoints, are of fundamental importance in pure and applied mathematics. In this paper, we study a natural functional on the space of square complex matrices whose global minimizers are normal ...
Tom Needham, Clayton Shonkwiler
doaj   +1 more source

Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

open access: yesJournal of Inequalities and Applications, 2011
In this paper, an efficient modified nonlinear conjugate gradient method for solving unconstrained optimization problems is proposed. An attractive property of the modified method is that the generated direction in each step is always descending without ...
Liu Jinkui, Wang Shaoheng
doaj  

Consensus-based optimisation with truncated noise

open access: yesEuropean Journal of Applied Mathematics
Consensus-based optimisation (CBO) is a versatile multi-particle metaheuristic optimisation method suitable for performing non-convex and non-smooth global optimisations in high dimensions.
Massimo Fornasier   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy