On convex generalized systems
DOI10.1023/A:1004641726264zbMATH Open1034.90015OpenAlexW58205425MaRDI QIDQ1573992FDOQ1573992
Authors: Giandomenico Mastroeni, Tamás Rapcsák 
Publication date: 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004641726264
Recommendations
- scientific article; zbMATH DE number 19086
- System of generalized equilibrium problems and applications in generalized convex spaces
- Generalized convexities
- Generalized convexity and mathematical programs
- scientific article; zbMATH DE number 4185402
- Generalized convexity and optimization. Theory and applications
- scientific article; zbMATH DE number 3845356
- scientific article; zbMATH DE number 486773
- Generalized Convexity in Nonlinear Programming
- On generalised convex mathematical programming
Optimality conditions and duality in mathematical programming (90C46) Geometry and structure of normed linear spaces (46B20) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- Smooth nonlinear optimization of \(\mathbb R^n\)
- On sufficiency of the Kuhn-Tucker conditions
- Theorems of the alternative and optimality conditions
- Minimax Theorems
- Optimality criteria in nonlinear programming involving nonconvex functions
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Problems of distance geometry and convex properties of quadratic maps
- Convexlike alternative theorems and mathematical programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inequality systems and optimization
- A class of nonconvex functions and mathematical programming
- Perfect duality for convexlike programs
- Über das von-Neumannsche Minimax-Theorem
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Cones, matrices and mathematical programming
- Zero duality gaps in infinite-dimensional programming
- Three kinds of generalized convexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some topological properties in optimization theory
- Title not available (Why is that?)
- Coercivity and image of constrained extremum problems
Cited In (16)
- Local convexity on smooth manifolds
- A new nonlinear scalarization function and applications
- Lagrangian duality and cone convexlike functions
- Some topics in vector optimization via image space analysis
- Set-valued systems with infinite-dimensional image and applications
- Image convexity of generalized systems with infinite-dimensional image and applications
- Connectedness of the solution sets in generalized semi-infinite set optimization
- Separation of sets and Wolfe duality
- Some applications of the image space analysis to the duality theory for constrained extremum problems
- The iterative methods for solving pseudomontone equilibrium problems
- Refinements on gap functions and optimality conditions for vector quasi-equilibrium problems via image space analysis
- Constrained extremum problems and image space analysis. I: Optimality conditions
- Duality for almost convex optimization problems via the perturbation approach
- Convex difference criteria for the quantitative stability of parametric quasidifferentiable systems
- Strong vector equilibrium problems
- Feasibility-solvability theorem for a generalized system
This page was built for publication: On convex generalized systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1573992)
