Results 61 to 70 of about 266 (177)
Bounded lower subdifferentiability optimization techniques: applications
, 2009 Lipschitz and quasiconvex programming, Global optimization, Cutting angle method, Abstract convexity, 90C26, 90C30,
Albert Ferrer, Gleb Beliakov
core +1 more source
Learning to steer nonlinear interior-point methods
EURO Journal on Computational Optimization, 2019 Interior-point or barrier methods handle nonlinear programs by sequentially solving barrier subprograms with a decreasing sequence of barrier parameters.
Renke Kuhlmann
doaj +1 more source
Order preserving functions and generalized convexity
, 1991 Primary 26B25, Secondary 90C30, 6A10, Generalized Convexity, Order Preservation, Mathematical Programming,
E. Castagnoli +2 more
core +1 more source
EURO Journal on Computational Optimization, 2015 Many real-world optimization models comprise nonconvex and nonsmooth functions leading to very hard classes of optimization models. In this article, a new interior-point method for the special, but practically relevant class of optimization problems with
Martin Schmidt
doaj +1 more source
Optimal value bounds in nonlinear programming with interval data
Interval systems, Nonlinear programming, Optimal value range, Interval matrix, Dependence, 90C30, 90C31, 90C70,
Milan Hladík
core +1 more source
Open MathematicsIn this article, we work on vector optimization problems in linear topological spaces. Our vector optimization problems have weakened convex inequality constraints and weakened affine equality constraints.
Zeng Renying
doaj +1 more source
Characterizing zero-derivative points
Zero-derivative point, Fermat’s extreme value theorem, Theorem of Lagrange, 26B05, 90C30,
Sanjo Zlobec
core +1 more source
SIOPRED: a prediction and optimisation integrated system for demand
Forecasting, Holt-Winters method, Non-linear optimisation, Decision support systems, 62M10, 62M20, 62P30, 90C30,
J. Bermúdez, J. Segura, E. Vercher
core +1 more source
A primal-dual interior-point algorithm for nonlinear least squares constrained problems
, 2005 Least squares, factorized quasi-Newton methods, primal-dual interior-point method, 90C30, 49M37,
M. Fernanda +4 more
core +1 more source
Advances in Nonlinear AnalysisWe introduce a constraint qualification condition GPMFCQ for smooth infinite programming problems, where the nonlinear operator defining the equality constraints has nonsurjective derivative at the local minimum.
Bednarczuk Ewa M. +2 more
doaj +1 more source