Results 91 to 100 of about 3,146 (222)

Optimality results for nondifferentiable multiobjective fractional programming problems under E-B-invexity

open access: yesResults in Control and Optimization
In this article, we study nonconvex multiobjective fractional programming problems involving E-differentiable functions (MFPE). We establish the E-Karush–Kuhn–Tucker (E-KKT) sufficient E-optimality conditions for nonsmooth vector optimization problems ...
Dhruv Singh   +3 more
doaj   +1 more source

Safe Stabilization Using Non‐Smooth Control Lyapunov Barrier Function

open access: yesInternational Journal of Robust and Nonlinear Control, Volume 36, Issue 11, Page 5823-5835, 25 July 2026.
ABSTRACT This paper addresses the challenge of safe stabilization, ensuring the system state reaches the origin while avoiding unsafe state regions. Existing approaches that rely on smooth Lyapunov barrier functions often fail to guarantee a feasible controller. To overcome this limitation, we introduce the non‐smooth control Lyapunov barrier function (
Jianglin Lan   +3 more
wiley   +1 more source

Análise e testes numéricos de um algoritmo de pontos interiores para programação não linear [PDF]

open access: yes, 2002
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Ciências Físicas e Matemáticas. Programa de Pós-Graduação em Matemática e Computação Científica.Neste trabalho apresentamos alguns aspectos computacionais e ...
Casali, Rafael Machado
core  

CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS

open access: yesTạp chí Khoa học Đại học Đà Lạt, 2012
Using duality theory, we propose a new approach to characterise solution set of a nonconvex optimisation problem. Several characterisations of solution set of the problem are established via it s dual problems.
Do Sang Kim, Tạ Quang Sơn
doaj   +1 more source

Generalized S-Lemma and strong duality in nonconvex quadratic programming [PDF]

open access: yes, 2013
On the basis of a new topological minimax theorem, a simple and unified approach is developed to Lagrange duality in nonconvex quadratic programming.
Tuy, H, Tuan, HD
core   +1 more source

Energy Efficiency Optimization for Mobile Ad Hoc Networks

open access: yesIEEE Access, 2016
Tremendous traffic demands for ubiquitous access and emerging multimedia applications significantly increase the energy consumption of battery-powered mobile devices.
Wen-Kuang Kuo, Shu-Hsien Chu
doaj   +1 more source

A Novel Practical and Fast Economic Method Based on Nonconvex Quadratic Programming [PDF]

open access: yes, 2019
In many industries such as power system, economic operations problems are usually nonconvex problems that are hard to be solved. This paper presents a novel YALMIP-based nonconvex quadratic programming model as a tool to find solution for which is ...
Seruca, Manuel, Rodrigues, David
core  

A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems [PDF]

open access: yes
We study a generic minimization problem with separable nonconvex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed-integer programming formulations each approximates the cost function by its lower convex ...
Keely L. Croxton   +2 more
core   +1 more source

Power Allocation Optimization Strategy Based on Full-duplex Relay Network [PDF]

open access: yesJisuanji gongcheng, 2018
This paper investigates the security performance in the full-duplex relay network.Targeting on the improvement of the security performance,the power allocation is optimized with the consideration of the maximum transmit power and minimum security rate ...
CHU Wanshun,ZHANG Qigui
doaj  

Technical Note—Sharper Bounds on Nonconvex Programs [PDF]

open access: yesOperations Research, 1974
Recently it was pointed out that the generalized Lagrange-multiplier method provides a sharper bound on a nonconvex program than does the solution of the program formed by taking convex envelopes of all functions involved in the original problem. This note points out that the bounds are the same if the original problem has only linear constraints, or ...
openaire   +1 more source

Home - About - Disclaimer - Privacy