scientific article; zbMATH DE number 994348
zbMATH Open0887.49001MaRDI QIDQ3126366FDOQ3126366
Stefan Rolewicz, D. Pallaschke
Publication date: 25 March 1997
Title of this publication is not available (Why is that?)
Recommendations
lower semicontinuityoptimality conditionsEkeland's variational principlemultifunctionstangent conescomplementarity problemsmonographynondifferentiable optimizationsubgradientsgeneralized derivativessubdifferentiabilityGâteaux differentiabilityRolewicz's drop property
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27) Programming in abstract spaces (90C48) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Cited In (89)
- A new approach to duality in vector optimization
- Quasi-relative interiors for graphs of convex set-valued mappings
- On economic equilibrium type problems with applications
- Regularly abstract convex functions with respect to the set of Lipschitz continuous concave functions
- Differentiability of strongly paraconvex vector-valued functions
- Optimal allocations with α‐MaxMin utilities, Choquet expected utilities, and prospect theory
- Infinitesimal calculus in metric spaces
- Least squares splines with free knots: Global optimization approach.
- Sufficient global optimality conditions for weakly convex minimization problems
- TWO POROSITY RESULTS IN MONOTONIC ANALYSIS
- 𝔹-Convex Sets and Functions
- Duality for set-valued multiobjective optimization problems. I: Mathematical programming
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Exact penalty functions and calmness for mathematical programming under nonlinear perturbations
- Economic equilibrium problems in reflexive Banach spaces
- Maximal abstract monotonicity and generalized Fenchel's conjugation formulas
- Duality for quasiconvex minimization over closed convex cones
- STABILITY OF SEMI-INFINITE INEQUALITY SYSTEMS INVOLVING MIN-TYPE FUNCTIONS
- A generalized Ekeland vector variational principle and its applications in optimization
- Topological convexities, selections and fixed points
- Abstract convex approximations of nonsmooth functions
- Optimality conditions in global optimization and their applications
- Global optimality conditions for some classes of optimization problems
- Are dualities appropriate for duality theories in optimization?
- On global optimality conditions via separation functions
- Saddle representations of positively homogeneous functions by linear functions
- Penalty functions with a small penalty parameter
- Conjugacies adapted to lower semicontinuous functions
- Critical duality
- A pre-order principle and set-valued Ekeland variational principle
- Pareto optimal allocations and dynamic programming
- \(P\)-functions, quasi-convex functions, and Hadamard-type inequalities
- Monotonic analysis over ordered topological vector spaces. IV
- Duality between multi-output production correspondences and cost functions
- Generalized convex relations with applications to optimization and models of economic dynamics
- Pareto optimality and Walrasian equilibria
- Separation, convexity and polarity in the space of normlinear functions
- Level sets relaxation, epigraphical relaxation and conditioning in optimization
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- On minimax theorems for lower semicontinuous functions in Hilbert spaces
- Vector topical function, abstract convexity and image space analysis
- Nash points, Ky Fan inequality and equilibria of abstract economies in Max-plus and \(\mathbb B\)-convexity
- Increasing convex-along-rays functions with applications to global optimization
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Positively homogeneous functions revisited
- On Lagrange Duality for Several Classes of Nonconvex Optimization Problems
- Lipschitz programming via increasing convex-along-rays functions*
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Challenges of continuous global optimization in molecular structure prediction
- Minimax theorems for extended real-valued abstract convex-concave functions
- Topical and sub-topical functions, downward sets and abstract convexity
- Abstract convexity of radiant functions with applications
- On the variational behaviour of functions with positive steepest descent rate
- Generalized Gerstewitz's functions and vector variational principle for \(\epsilon\)-efficient solutions in the sense of Németh
- Some criteria for maximal abstract monotonicity
- Jensen's inequality for \(g\)-convex function under \(g\)-expectation
- Global sufficient optimality conditions for a special cubic minimization problem
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- A geometric representation of the Morse fan
- Characterizing global maximizers of the difference of sub-topical functions
- On the coincidence of some subdifferentials in the class of α(.)-paraconvex functions
- Nonsmooth Optimization
- Dynamic programming with ordered structures: Theory, examples and applications
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- An alogrithm for monotonic global optimization problems∗
- Cutting angle methods in global optimization
- The formulas for the representation of functions of two variables as a difference of sublinear functions
- Duality for composite optimization problem within the framework of abstract convexity
- On duality for nonconvex minimization problems within the framework of abstract convexity
- Generalized cutting plane method for solving nonlinear stochastic programming problems
- Tropical reproducing kernels and optimization
- Title not available (Why is that?)
- Wasserstein barycenters in the manifold of all positive definite matrices
- Grundlagen der Mathematischen Optimierung
- Characterization of solutions of strong-weak convex programming problems
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- Fenchel-Moreau Conjugation Inequalities with Three Couplings and Application to Stochastic Bellman Equation
- THE WEAK DROP PROPERTY AND THE DE LA VALL´EE POUSSIN THEOREM
- Duality assertions in vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Title not available (Why is that?)
- Abstract convexity, global optimization and data classification.
- On some generalizations of Hadamard's inversion theorem beyond differentiability
- A note on duality in reverse convex optimization
- Variational properties of the abstract subdifferential operator
- Minimal convex majorants of functions and Demyanov–Rubinov exhaustive super(sub)differentials
- On ℋn+1-convex functions: asymptotic behaviour and subdifferentials
- Duality for minimization of the difference of two \(\Phi_c\)-convex functions
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3126366)