Semismooth Newton methods for solving semi-infinite programming problems
From MaRDI portal
Recommendations
- A smoothing Newton method for semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Semismooth Newton methods for variational problems with inequality constraints
- scientific article; zbMATH DE number 5937962
- Semismooth Newton method for quadratic programs with bound constraints
- A smoothing approach for semi-infinite programming with projected Newton-type algorithm
- The semismooth Newton method for the solution of quasi-variational inequalities
- Applications of semi-smooth Newton methods to variational inequalities
- scientific article; zbMATH DE number 1552023
Cited in
(52)- A smoothing projected Newton-type algorithm for semi-infinite programming
- A smoothing approach for semi-infinite programming with projected Newton-type algorithm
- A filter trust region method for solving semi-infinite programming problems
- A noninterior point homotopy method for semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- Global convergence of a class of smooth penalty methods for semi-infinite programming
- An augmented Lagrangian algorithm for solving semiinfinite programming
- A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard
- How to solve a semi-infinite optimization problem
- A spline smoothing Newton method for semi-infinite minimax problems
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Smoothing SQP algorithm for semismooth equations with box constraints
- A homotopy interior point method for semi-infinite programming problems
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- Non-convex semi-infinite min-max optimization with noncompact sets
- A semismooth Newton method for solving optimal power flow
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A sequential systems of linear equations method with arbitrary initial point for semi-infinite programming
- A nonsmooth Newton method with path search and its use in solving \(C^{1,1}\) programs and semi-infinite problems
- Interior point filter method for semi-infinite programming problems
- An M-objective penalty function algorithm under big penalty parameters
- An iterative method for solving KKT system of the semi-infinite programming
- A second-order smooth penalty function algorithm for constrained optimization problems
- The semismooth approach for semi-infinite programming without strict complementarity
- A semi-smooth Newton method for solving elliptic equations with gradient constraints
- On the convergence of a smoothed penalty algorithm for semi-infinite programming
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
- Solving semi-infinite programs by smoothing projected gradient method
- A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs
- scientific article; zbMATH DE number 5937962 (Why is no real title available?)
- Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- On a Semismooth* Newton Method for Solving Generalized Equations
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- scientific article; zbMATH DE number 7774549 (Why is no real title available?)
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
- A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- An inexact primal-dual algorithm for semi-infinite programming
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- Some structural properties of a Newton-type method for semidefinite programs
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- The semismooth approach for semi-infinite programming under the reduction ansatz
- New approach for the nonlinear programming with transient stability constraints arising from power systems
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: Semismooth Newton methods for solving semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407248)
