Pages that link to "Item:Q1813335"
From MaRDI portal
The following pages link to Computational schemes for large-scale problems in extended linear- quadratic programming (Q1813335):
Displaying 28 items.
- New exact penalty function for solving constrained finite min-max problems (Q764635) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- A smoothing trust-region Newton-CG method for minimax problem (Q928081) (← links)
- Modified proximal point algorithm for extended linear-quadratic programming (Q1203069) (← links)
- Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization (Q1294445) (← links)
- Newton's method for linear inequality systems (Q1296136) (← links)
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems (Q1332309) (← links)
- An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
- Solving large-scale minimax problems with the primal-dual steepest descent algorithm (Q1340066) (← links)
- Solution of monotone complementarity problems with locally Lipschitzian functions (Q1356058) (← links)
- The approximation of separable stochastic programs (Q1893960) (← links)
- An SQP algorithm for extended linear-quadratic problems in stochastic programming (Q1896457) (← links)
- Newton's method for quadratic stochastic programs with recourse (Q1900750) (← links)
- Minimization of \(SC^ 1\) functions and the Maratos effect (Q1905075) (← links)
- Sensitivity analysis for generalized linear-quadratic problems (Q1918287) (← links)
- A predictor-corrector method for extended linear-quadratic programming (Q1919785) (← links)
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization (Q1938516) (← links)
- A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
- A nonsmooth version of Newton's method (Q2367915) (← links)
- A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems (Q2434995) (← links)
- Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption (Q2515067) (← links)
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs (Q2565034) (← links)
- Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints (Q3096884) (← links)
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications (Q3622019) (← links)
- Linear‐quadratic efficient frontiers for portfolio optimization (Q4299536) (← links)
- The iterative methods for monotone generalized variational inequalities (Q4375432) (← links)
- Convex optimization problems with arbitrary right-hand side perturbations (Q4675961) (← links)
- A globally and superlinearly convergent trust region method for \(LC^1\) optimization problems (Q5936233) (← links)
