Pages that link to "Item:Q4090135"
From MaRDI portal
The following pages link to Necessary and sufficient conditions for a penalty method to be exact (Q4090135):
Displaying 12 items.
- Exact penalty functions and stability in locally Lipschitz programming (Q3714912) (← links)
- Exact penalty functions in nonlinear programming (Q3859569) (← links)
- A first order, exact penalty function algorithm for equality constrained optimization problems (Q4181618) (← links)
- Théorie de la pénalisation exacte (Q4712727) (← links)
- Convergence analysis of a proximal newton method<sup>1</sup> (Q4714551) (← links)
- Distributed Bregman-Distance Algorithms for Min-Max Optimization (Q5023087) (← links)
- DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS (Q5174338) (← links)
- Multipliers and general Lagrangians (Q5317740) (← links)
- A centre–free approach for resource allocation with lower bounds (Q5348382) (← links)
- Linear programming with nonparametric penalty programs and iterated thresholding (Q5882227) (← links)
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation (Q6131454) (← links)
- Distributed predefined-time optimal economic dispatch for microgrids (Q6606000) (← links)