Characterizations of the solution set for a class of nonsmooth optimization problems
From MaRDI portal
Publication:1947617
Recommendations
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- On solution sets for convex optimization problems
- scientific article; zbMATH DE number 6500667
- The characterizations of optimal solution set in programming problem under inclusion constrains
Cites work
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- A characterization of the solution set of pseudoconvex extremum problems
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Characterizations of the solution sets of convex programs and variational inequality problems
- Codifferential method for minimizing nonsmooth DC functions
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- Generalized pseudolinearity
- Infine functions, nonsmooth alternative theorems and vector optimization problems
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing solution set of non-differentiable \(\eta \)-pseudolinear extremum problem
- On characterizing the solution sets of pseudoinvex extremum problems
- On characterizing the solution sets of pseudolinear programs
- Optimization and nonsmooth analysis
- Some characterizations of locally Lipschitz pseudolinear functions
- Some remarks on nonsmooth critical point theory
Cited in
(21)- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- On solution sets for robust optimization problems
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- scientific article; zbMATH DE number 7450966 (Why is no real title available?)
- Characterizing robust solution sets of convex programs under data uncertainty
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- The characterizations of optimal solution set in programming problem under inclusion constrains
- Characterizations of the solution set for non-essentially quasiconvex programming
- Optimality characterizations for approximate nondominated and Fermat rules for nondominated solutions
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
- On characterization of solution sets of set-valued pseudoinvex optimization problems
- Characterizations of the solution set of nonsmooth semi-infinite programming problems on Hadamard manifolds
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions and constraint qualifications for quasiconvex programming
- Characterizations of robust solution set of convex programs with uncertain data
This page was built for publication: Characterizations of the solution set for a class of nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947617)
