Pages that link to "Item:Q1233814"
From MaRDI portal
The following pages link to Approximation procedures based on the method of multipliers (Q1233814):
Displaying 16 items.
- Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
- Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems (Q939107) (← links)
- Generic algorithm for generalized fractional programming (Q1029285) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- Algorithms for a class of nondifferentiable problems (Q1136702) (← links)
- An algorithm for convex constrained minimax optimization based on duality (Q1160889) (← links)
- Multiplier methods: A survey (Q1223623) (← links)
- Regularized smoothing approximations to vertical nonlinear complementarity problems (Q1284038) (← links)
- Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (Q2089785) (← links)
- Guaranteed deterministic approach to superhedging: a numerical experiment (Q2130707) (← links)
- Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
- A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
- Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution (Q2421451) (← links)
- Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)