Pages that link to "Item:Q1407248"
From MaRDI portal
The following pages link to Semismooth Newton methods for solving semi-infinite programming problems (Q1407248):
Displaying 47 items.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- An M-objective penalty function algorithm under big penalty parameters (Q328083) (← links)
- A second-order smooth penalty function algorithm for constrained optimization problems (Q354635) (← links)
- On the convergence of a smoothed penalty algorithm for semi-infinite programming (Q376724) (← links)
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming (Q836067) (← links)
- Some structural properties of a Newton-type method for semidefinite programs (Q852154) (← links)
- On the smoothing of the square-root exact penalty function for inequality constrained optimization (Q861516) (← links)
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints (Q929614) (← links)
- The semismooth approach for semi-infinite programming under the reduction ansatz (Q933800) (← links)
- New approach for the nonlinear programming with transient stability constraints arising from power systems (Q967215) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
- A smoothing approach for semi-infinite programming with projected Newton-type algorithm (Q1013456) (← links)
- A filter trust region method for solving semi-infinite programming problems (Q1032551) (← links)
- A noninterior point homotopy method for semi-infinite programming problems (Q1743361) (← links)
- A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
- Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
- An augmented Lagrangian algorithm for solving semiinfinite programming (Q1952762) (← links)
- A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard (Q2154354) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
- Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033) (← links)
- Smoothing SQP algorithm for semismooth equations with box constraints (Q2376126) (← links)
- A homotopy interior point method for semi-infinite programming problems (Q2385505) (← links)
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming (Q2392971) (← links)
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
- Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
- A semismooth Newton method for solving optimal power flow (Q2468868) (← links)
- Interior point filter method for semi-infinite programming problems (Q3111139) (← links)
- An iterative method for solving KKT system of the semi-infinite programming (Q3369516) (← links)
- A semi-smooth Newton method for solving elliptic equations with gradient constraints (Q3623228) (← links)
- (Q3840143) (← links)
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems (Q3988950) (← links)
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations (Q4562340) (← links)
- A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs (Q4900532) (← links)
- (Q5198964) (← links)
- Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming (Q5357005) (← links)
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems (Q5409739) (← links)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)
- (Q6083639) (← links)
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications (Q6107989) (← links)