Pages that link to "Item:Q1777435"

The following pages link to A smoothing Newton method for semi-infinite programming (Q1777435):

Displaying 49 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• On the convergence of a smoothed penalty algorithm for semi-infinite programming (Q376724) (← links)
• Nonsmooth semi-infinite programming problem using limiting subdifferentials (Q454252) (← links)
• Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
• An iterative method for solving semismooth equations (Q697540) (← links)
• Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
• Convergence properties of a class of exact penalty methods for semi-infinite optimization problems (Q784779) (← 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)
• A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints (Q929614) (← links)
• A smoothing Newton method for a type of inverse semi-definite quadratic programming problem (Q953410) (← 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)
• Semismooth Newton methods for solving semi-infinite programming problems (Q1407248) (← links)
• The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
• A noninterior point homotopy method for semi-infinite programming problems (Q1743361) (← links)
• A discretization based smoothing method for solving semi-infinite variational inequalities (Q1780133) (← links)
• Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
• Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults (Q1942027) (← links)
• An augmented Lagrangian algorithm for solving semiinfinite programming (Q1952762) (← links)
• Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
• Multiobjective DC programs with infinite convex constraints (Q2249821) (← links)
• A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
• Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity (Q2341603) (← 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)
• 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)
• Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing (Q2570654) (← links)
• A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations (Q2795093) (← links)
• A spline smoothing homotopy method for nonconvex nonlinear programming (Q2810089) (← links)
• A smoothing approach for the optimal parameter selection problem with continuous inequality constraint (Q2867401) (← links)
• (Q2966394) (← links)
• Interior point filter method for semi-infinite programming problems (Q3111139) (← links)
• (Q3403618) (← links)
• A semi-smooth Newton method for solving elliptic equations with gradient constraints (Q3623228) (← 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)
• On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
• (Q5295776) (← links)
• Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)
• Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications (Q6107989) (← links)
• A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints (Q6182689) (← links)