Pages that link to "Item:Q3859569"
From MaRDI portal
The following pages link to Exact penalty functions in nonlinear programming (Q3859569):
Displayed 50 items.
- Approximate solutions of multiobjective optimization problems (Q259809) (← links)
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm (Q299647) (← links)
- An M-objective penalty function algorithm under big penalty parameters (Q328083) (← links)
- Smooth exact penalty functions. II: A reduction to standard exact penalty functions (Q331994) (← links)
- The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (Q331995) (← links)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems (Q409835) (← links)
- A line search exact penalty method using steering rules (Q431002) (← links)
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems (Q440840) (← links)
- A power penalty method for second-order cone nonlinear complementarity problems (Q492069) (← links)
- A penalty function method based on smoothing lower order penalty function (Q548295) (← links)
- Second-order analysis of penalty function (Q604260) (← links)
- A new exact exponential penalty function method and nonconvex mathematical programming (Q632914) (← links)
- An estimation of exact penalty for infinite-dimensional inequality-constrained minimization problems (Q645064) (← links)
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem (Q654062) (← links)
- The exact penalty principle (Q654106) (← links)
- Restricted generalized Nash equilibria and controlled penalty algorithm (Q693196) (← links)
- Sequential quadratic programming with a flexible step acceptance strategy (Q693514) (← links)
- Finite perturbation of convex programs (Q810372) (← links)
- Exact penalty results for mathematical programs with vanishing constraints (Q844990) (← links)
- On the smoothing of the square-root exact penalty function for inequality constrained optimization (Q861516) (← links)
- Existence and stability of exact penalty for optimization problems with mixed constraints (Q923964) (← links)
- Penalty function methods and a duality gap for invex optimization problems (Q923993) (← links)
- A derivative-free algorithm for systems of nonlinear inequalities (Q941047) (← links)
- Existence of exact penalty and its stability for nonconvex constrained optimization problems in Banach spaces (Q1005129) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- A method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- On the exactness of a class of nondifferentiable penalty functions (Q1090620) (← links)
- Exact penalties and sufficient conditions for optimality in nonsmooth optimization (Q1090624) (← links)
- Lower bounds of controlling parameters of exact penalty functions in locally Lipschitz programming (Q1093538) (← links)
- Image space approach to penalty methods (Q1117841) (← links)
- A globally convergent algorithm for exact penalty functions (Q1149884) (← links)
- An algorithm for linearly constrained nonlinear programming problems (Q1151830) (← links)
- A stable theorem of the alternative: An extension of the Gordan theorem (Q1166412) (← links)
- A least-distance programming procedure for minimization problems under linear constraints (Q1170113) (← links)
- Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities (Q1172370) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions (Q1199753) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- A globally convergent SQP method for semi-infinite nonlinear optimization (Q1262218) (← links)
- Duality and regularization for inf-sup problems (Q1263076) (← links)
- Differential stability in non-Lipschitzian optimization (Q1321164) (← links)
- Nonlinear complementarity as unconstrained and constrained minimization (Q1321650) (← links)
- Optimality conditions in mathematical programming and composite optimization (Q1341569) (← links)
- Separating plane algorithms for convex optimization (Q1356051) (← links)
- Transversality in variational analysis (Q1673886) (← links)
- An objective penalty function-based method for inequality constrained minimization problem (Q1721383) (← links)
- New exact penalty functions for nonlinear constrained optimization problems (Q1724863) (← links)
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)