A smoothing Newton method for semi-infinite programming
From MaRDI portal
Publication:1777435
DOI10.1007/s10898-004-8266-zzbMath1066.90131OpenAlexW1981417350MaRDI QIDQ1777435
Judy Tam, Liqun Qi, Soon-Yi Wu, Dong-hui Li
Publication date: 17 May 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-8266-z
Optimality conditions and duality in mathematical programming (90C46) Methods of quasi-Newton type (90C53) Semi-infinite programming (90C34)
Related Items (35)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Global convergence of a robust smoothing SQP method for semi-infinite programming ⋮ 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 ⋮ On the convergence of a smoothed penalty algorithm for semi-infinite programming ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications ⋮ Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults ⋮ A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ An augmented Lagrangian algorithm for solving semiinfinite programming ⋮ Nonsmooth semi-infinite programming problem using limiting subdifferentials ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints ⋮ A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ Multiobjective DC programs with infinite convex constraints ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ An iterative method for solving semismooth equations ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ A spline smoothing homotopy method for nonconvex nonlinear programming ⋮ Interior point filter method for semi-infinite programming problems ⋮ Convergence properties of a class of exact penalty methods for semi-infinite optimization problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity ⋮ A smoothing approach for the optimal parameter selection problem with continuous inequality constraint ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent methods for semi-infinite programming
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Optimization. Algorithms and consistent approximations
- Semismooth Newton methods for solving semi-infinite programming problems
- Smoothing Newton and quasi-Newton methods for mixed complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems
- Nonsmooth Equations: Motivation and Algorithms
- Semi-Infinite Programming: Theory, Methods, and Applications
- Directional derivative of the marginal function in nonlinear programming
- A projected lagrangian algorithm for semi-infinite programming
- Optimization and nonsmooth analysis
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- A penalty approach to iterative algorithms for envelope constrained filter design
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- Local Convergence of SQP Methods in Semi-Infinite Programming
- Computational discretization algorithms for functional inequality constrained optimization
- A smoothing Gauss-Newton method for the generalized HLCP
- Second-order optimality conditions in generalized semi-infinite programming
This page was built for publication: A smoothing Newton method for semi-infinite programming
