Convergence of a class of penalty methods for constrained scalar set-valued optimization
From MaRDI portal
Publication:2393088
DOI10.1007/S10898-012-9910-7zbMATH Open1291.90308OpenAlexW1979417824MaRDI QIDQ2393088FDOQ2393088
Authors: Yanyan Li
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9910-7
Recommendations
- Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints
- Calmness and exact penalization in constrained scalar set-valued optimization
- On the convergence of the penalty function method with respect to a functional
- On continuity of point-to-set mappings associated with the penalty-function method
- Functional convergence theorems for the penalty function method
convergencepenalty methodsconstrained scalar set-valued optimizationlower semicontinuity of a functionupper semicontinuity of a set-valued map
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of multiobjective optimization
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Unified theory of augmented Lagrangian methods for constrained global optimization
- Vector optimization. Set-valued and variational analysis.
- Duality for set-valued measures of risk
- Mathematical Programs with Equilibrium Constraints
- Calmness and Exact Penalization
- Optimality conditions for several types of efficient solutions of set-valued optimization problems
- Lagrange-type functions in constrained non-convex optimization.
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Exact penalty functions and stability in locally Lipschitz programming
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- Unified nonlinear Lagrangian approach to duality and optimal paths
- The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Lower-order penalization approach to nonlinear semidefinite programming
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Calmness and exact penalization in constrained scalar set-valued optimization
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Sensitivity and stability analysis for nonlinear programming
Cited In (11)
- Convergence of sequential approximation method for constrained optimization problems
- New exact penalty functions for nonlinear constrained optimization problems
- Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints
- Modified Newton method based iterative learning control design for discrete nonlinear systems with constraints
- On the sensitivity of Pareto efficiency in set-valued optimization problems
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- Calmness and exact penalization for constrained vector set-valued optimization problems
- Title not available (Why is that?)
- Convergence properties of a class of exact penalty methods for semi-infinite optimization problems
- Calmness and exact penalization in constrained scalar set-valued optimization
This page was built for publication: Convergence of a class of penalty methods for constrained scalar set-valued optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393088)