On characterizing solution set of non-differentiable -pseudolinear extremum problem
From MaRDI portal
Publication:3225080
DOI10.1080/02331934.2010.505653zbMATH Open1261.90038OpenAlexW1966285127MaRDI QIDQ3225080FDOQ3225080
Authors: Kequan Zhao, Liping Tang
Publication date: 15 March 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.505653
Recommendations
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)
Cites Work
- Pre-invex functions in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- On invex sets and preinvex functions
- Characterizations of solution sets of convex vector minimization problems
- Pseudolinearity and efficiency
- Characterizations of the solution sets of convex programs and variational inequality problems
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- A simple characterization of solutions sets of convex programs
- On characterizing the solution sets of pseudolinear programs
- Convex composite multi-objective nonsmooth programming
- Infinite-dimensional convex programming with applications to constrained approximation
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- An extension of pseudolinear functions and variational inequality problems
- Characterization of solution sets of convex programs
- Characterizations and applications of prequasi-invex functions.
- On pseudolinear functions
- First and second order characterizations of pseudolinear functions
- Generalized invexity and generalized invariant monotonicity
- Generalized invariant monotonicity and invexity of non-differentiable functions
- Pseudolinear Programming
Cited In (4)
- Nonsmooth minimax fractional programming involving {\(\eta\)}-pseudolinear functions
- Characterizations of robust solution set of convex programs with uncertain data
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Characterizations of the solution set for a class of nonsmooth optimization problems
This page was built for publication: On characterizing solution set of non-differentiable \(\eta \)-pseudolinear extremum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225080)