Optimality Conditions for Double-sparsity Constrained Optimization

Sparse optimization has witnessed advancements in recent decades,and the step function finds extensive applications across various machine learning and signal processing domains.This paper integrates zero norm and the step function to formulate a doublesparsity constrained optimization problem,wherein a linear equality constraint is also taken into consideration.By defining aτ-Lagrangian stationary point and a KKT point,we establish the first-order and second-order necessary and sufficient optimality conditions for the problem.Furthermore,we thoroughly elucidate their relationships to local and global optimal solutions.Finally,special cases and examples are presented to illustrate the obtained theorems.

AN OPTIMAL CONTROL PROBLEM FOR A LOTKA-VOLTERRA COMPETITION MODEL WITH CHEMO-REPULSION

In this paper we study a bilinear optimal control problem for a diffusive Lotka-Volterra competition model with chemo-repulsion in a bounded domain of ℝ^(ℕ),N=2,3.This model describes the competition of two species in which one of them avoid encounters with rivals through a chemo-repulsion mechanism.We prove the existence and uniqueness of weak-strong solutions,and then we analyze the existence of a global optimal solution for a related bilinear optimal control problem,where the control is acting on the chemical signal.Posteriorly,we derive first-order optimality conditions for local optimal solutions using the Lagrange multipliers theory.Finally,we propose a discrete approximation scheme of the optimality system based on the gradient method,which is validated with some computational experiments.

SECOND-ORDER OPTIMALITY CONDITIONS FOR OPTIMAL CONTROL PROBLEMS GOVERNED BY 3-DIMENSIONAL NEVIER-STOKES EQUATIONS

This article is concerned with second-order necessary and sufficient optimality conditions for optimal control problems governed by 3-dimensional Navier-Stokes equations. The periodic state constraint is considered.

OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.

Optimal reaction conditions for pyridine synthesis in riser reactor

Pjridine has been generally synthesized by aldehydes and ammonia in a turbulent fluidized-bed reactor. In this paper, a novel riser reactor was proposed for pyridine synthesis. Experiment result showed that the yield of pyridine and 3-picoline decreased, but the selectivity of pyridine over 3-picoline increased compared to turbulent fluidized-bed reactor. Based on experimental data, a modified kinetic model was used for the determination of optimal operating condition for riser reactor. The optimal operating condition of riser reactor given by this modified model was as follows： The reaction temperature of 755 K, catalyst to feedstock ratio （CTFR） of 87, residence timeof3.8sandinitialacetaldehydesconcentrationof0.0029mol.L-1 （acetaldehydes to formaldehydes ratio by mole （ATFR） of 0.65 and ammonia to aldehydes ratio by mole （ATAR） of 0.9, water contention of 63wt% （formaldehyde solution））.

Sufficient Optimality Conditions for Multiobjective Programming Involving (V, ρ)h,ψ-type Ⅰ Functions

New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.

THE OPTIMALITY CONDITIONS OF NONCONVEXSET-VALUED VECTOR OPTIMIZATION

The concepts of alpha-order Clarke's derivative, alpha-order Adjacent derivative and alpha-order G.Bouligand derivative of set-valued mappings are introduced, their properties are studied, with which the Fritz John optimality condition of set-valued vector optimization is established. Finally, under the assumption of pseudoconvexity, the optimality condition is proved to be sufficient.

Global optimality conditions for quadratic 0-1 programming with inequality constraints

Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are presented.The necessary condition is expressed without dual variables.The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.

Optimality Conditions and Duality for Nonsmooth Multiobjective Programms with Generalized Essential Convexity

In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution. We set up Mond-Weir type duality and Craven type duality for nonsmooth multiobjective programming with generalized essentially convex functions, and prove them.

Necessary Optimality Conditions for Multi-Objective Semi-Infinite Variational Problem

In this paper, necessary optimality conditions for a class of Semi-infinite Variational Problems are established which are further generalized to a class of Multi-objective Semi-Infinite Variational Problems. These conditions are responsible for the development of duality theory which is an extremely important feature for any class of problems, but the literature available so far lacks these necessary optimality conditions for the stated problem. A lemma is also proved to find the topological dual of as it is required to prove the desired result.

Optimality conditions in set optimization employing higher-order radial derivatives

There are two approaches of defining the solutions of a set-valued optimization problem： vector criterion and set criterion. This note is devoted to higher-order optimality conditions using both criteria of solutions for a constrained set-valued optimization problem in terms of higher-order radial derivatives. In the case of vector criterion, some optimality conditions are derived for isolated （weak） minimizers. With set criterion, necessary and sufficient optimality conditions are established for minimal solutions relative to lower set-order relation.

The Optimality Conditions for Multiobjective Semi-infinite Programming Involving Generalized Unified （C, α, p, d）-convexity

The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.

Higher-order Optimality Conditions for Henig Effcient Solution in Set-valued Optimization under Cone-convexlike Maps

This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for Henig effcient solutions of set-valued optimization problems whose constraint condition is determined by a fixed set.

Some Convexificators-Based Optimality Conditions for Nonsmooth Mathematical Program with Vanishing Constraints

In this paper, by using the notion of convexificator, we introduce the generalized standard Abadie constraint qualification and the generalized MPVC Abadie constraint qualification, and define the generalized stationary conditions for the nonsmooth mathematical program with vanishing constraints (MPVC for short). We show that the generalized strong stationary is the first order necessary optimality condition for nonsmooth MPVC under the generalized standard Abadie constraint qualification. Sufficient conditions for global or local optimality for nonsmooth MPVC are also derived under some generalized convexity assumptions.

Optimization of Extraction Conditions of Pomegranate Peel Polyphenols and Its Protective Effect on Acute Alcoholic Liver Injury in Mice

[Objectives]This study was conducted to explore the optimization of ultrasonic-assisted organic solvent extraction of pomegranate peel polyphenols(PPPs),and to study the protective effect of PPPs on acute alcoholic liver injury in mice.[Methods]The optimal extraction conditions of PPPs were determined by single factor and orthogonal experiments,and an acute alcoholic liver injury model in mice was established.Bifendate was used as the positive control group to investigate the protective effect of low,medium and high doses of PPPs on acute alcoholic liver injury.[Results]The optimum extraction process parameters were followed as 60%ethanol concentration,solid-liquid ratio of 1:40(w/v),extraction temperature of 50℃,and extraction time of 1.5 h,and the yield was 1.42%.The results of animal experiments showed that PPPs could effectively reduce the degree of alcoholic liver injury in mice,reduce the levels of serum alanine aminotransferase(ALT)and aspartate aminotransferase(AST),and reduce the inflammation and necrosis of liver tissue in mice.Meanwhile,the total polyphenols from pomegranate peel also significantly reduced the expression levels of malondialdehyde(MDA),tumor necrosis factor(TNF-α)and interleukin-6(IL-6)in mice,and increased the levels of superoxide dismutase(SOD)and reduced glutathione(GSH)in liver tissue of mice,indicating its antioxidant and anti-inflammatory effects,further illustrating its protective effect on alcoholic liver injury.[Conclusions]PPPs could reduce the expression levels of TNF-α,IL-6 and MDA in mice,and increase the expression levels of SOD and GSH to achieve the protective effect on acute alcoholic liver injury in mice.This study will provide new ideas for the development of new anti-alcoholic liver injury drug resources.

Optimization of Extraction Conditions for Total Flavonoids from Fructus Aurantii Immaturus and Its Anti-UVB Radiation Activity

[Objectives]Optimum extraction conditions of total flavonoids from Fructus Aurantii Immaturus(TFFAI)and its resistance activity to ultraviolet radiation were investigated in present research.[Methods]The optimal extraction conditions of TFFAI were determined by single factor and orthogonal experiments,and the survival rate of TFFAI on HaCaT cells irradiated with UVB rays was investigated.It s antioxidant capacity was determined by ABTS.[Results]The results showed that the highest yield of TFFAI was obtained with 70%ethanol at a solid-to-liquid ratio of 1:50(w/v)and 40℃for 1.5 h by single-factor and orthogonal experiments.Total flavonoids(0.25-1.00 mg/ml)could significantly improve the survival rate of HaCaT cell line.Meanwhile,the maximum absorption peak of TFFAI was found at 283 nm,and in-vitro antioxidant experiment identified that TFFAI had a good clearance rate to ABTS.It suggestes that TFFAI could protect the cells from UVB damage by absorption of UVB rays and anti-oxidation.[Conclusions]TFFAI played a protective role on UVB irradiated cells through UVB ultraviolet absorption and antioxidant pathways.

Optimization of Conditions for the Extraction of Melanin from Walnut Husk

[Objective] This study was conducted optimize the conditions for the ex- traction of melanin from walnut husk. [Method] Melanin was isolated from walnut husk through alkali extraction and acid precipitation, and the factors that may influ- ence the extraction efficiency： temperature, duration, NaOH concentration and solid- liquid ratio were set at different levels. [Result] The optimal conditions for the ex- traction of melanin from walhut husk were temperature of 80 ℃, extraction duration of 120 min, NaOH concentration of 70 mol/L, and solid-liquid ratio of 1：20. [Conclu- sion] The optimal conditions for the extraction of melanin from walnut husk deter- mined in the present study will provide references for the development and utiliza- tion of natural melanin.

GLOBAL CONVERGENCE OF A CLASS OF OPTIMALLY CONDITIONED SSVM METHODS

This paper explores the convergence of a class of optimally conditioned self scaling variable metric (OCSSVM) methods for unconstrained optimization. We show that this class of methods with Wolfe line search are globally convergent for general convex functions.

A Modified Lagrange Method for Solving Convex Quadratic Optimization Problems

In this paper, a modified version of the Classical Lagrange Multiplier method is developed for convex quadratic optimization problems. The method, which is evolved from the first order derivative test for optimality of the Lagrangian function with respect to the primary variables of the problem, decomposes the solution process into two independent ones, in which the primary variables are solved for independently, and then the secondary variables, which are the Lagrange multipliers, are solved for, afterward. This is an innovation that leads to solving independently two simpler systems of equations involving the primary variables only, on one hand, and the secondary ones on the other. Solutions obtained for small sized problems (as preliminary test of the method) demonstrate that the new method is generally effective in producing the required solutions.