Results 31 to 40 of about 24,658 (179)

Sufficient optimality criteria and duality for multiobjective variational control problems with B-(p,r)-invex functions [PDF]

open access: yesOpuscula Mathematica, 2014
In this paper, we generalize the notion of \(B\)-\((p,r)\)-invexity introduced by Antczak in [A class of \(B\)-\((p; r)\)-invex functions and mathematical programming, J. Math. Anal. Appl. 286 (2003), 187-206] for scalar optimization problems to the case
Tadeusz Antczak, Manuel Arana Jiménez
doaj   +1 more source

A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure

open access: yes, 2014
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions.
Hu, Shenglong, Li, Guoyin, Qi, Liqun
core   +1 more source

Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming

open access: yesMathematics, 2023
The systematic design of exact optimal designs of experiments is typically challenging, as it results in nonconvex optimization problems. The literature on the computation of model-based exact optimal designs of experiments via mathematical programming ...
Belmiro P. M. Duarte
doaj   +1 more source

An Accelerating Algorithm for Linear Multiplicative Programming Problem

open access: yesIEEE Access, 2020
By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP).
Shuai Tang, Zhisong Hou, Longquan Yong
doaj   +1 more source

Combined Heat and Power Dynamic Economic Dispatch with Emission Limitations Using Hybrid DE-SQP Method

open access: yesAbstract and Applied Analysis, 2013
Combined heat and power dynamic economic emission dispatch (CHPDEED) problem is a complicated nonlinear constrained multiobjective optimization problem with nonconvex characteristics.
A. M. Elaiw, X. Xia, A. M. Shehata
doaj   +1 more source

Magneto‐X Effects in Magnetic Soft Materials and Their Applications

open access: yesAdvanced Science, EarlyView.
This review systematically explores magnetic soft materials (MSMs), a novel class of composites that transform under magnetic fields. It catalogs fundamental “Magneto‐X” effects, classifies materials by their matrix and magnetic fillers, and highlights transformative applications in soft robotics, biomedical devices, flexible electronics, etc. Finally,
Ziyin Xiang   +5 more
wiley   +1 more source

An ADMM-based SQP method for separably smooth nonconvex optimization

open access: yesJournal of Inequalities and Applications, 2020
This work is about a splitting approach for solving separably smooth nonconvex linearly constrained optimization problems. Based on the ideas from two classical methods, namely the sequential quadratic programming (SQP) and the alternating direction ...
Meixing Liu, Jinbao Jian
doaj   +1 more source

Reformulations of mathematical programming problems as linear complementarity problems [PDF]

open access: yes, 1982
A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Judice, JJ, Mitra, G
core  

Trust‐region filter algorithms utilizing Hessian information for gray‐box optimization

open access: yesAIChE Journal, EarlyView.
Abstract Optimizing industrial processes often involves gray‐box models that couple algebraic glass‐box equations with black‐box components lacking analytic derivatives. Such systems challenge derivative‐based solvers. The classical trust‐region filter (TRF) algorithm provides a robust framework but requires extensive parameter tuning and numerous ...
Gul Hameed   +4 more
wiley   +1 more source

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

open access: yesJournal 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

Home - About - Disclaimer - Privacy