A new smoothing Newton-type algorithm for semi-infinite programming
From MaRDI portal
Publication:969747
DOI10.1007/s10898-009-9462-7zbMath1220.90144OpenAlexW2009717218MaRDI QIDQ969747
Liqun Qi, Qin Ni, Chen Ling, Soon-Yi Wu
Publication date: 7 May 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9462-7
Related Items
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, Smoothing SQP algorithm for semismooth equations with box constraints, Feasible Method for Semi-Infinite Programs, A smoothing Levenberg-Marquardt method for generalized semi-infinite programming, Non-convex semi-infinite min-max optimization with noncompact sets, Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications, Solving semi-infinite programs by smoothing projected gradient method, A noninterior point homotopy method for semi-infinite programming problems, A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations, On solving a class of linear semi-infinite programming by SDP method, Interior point filter method for semi-infinite programming problems, An inexact primal-dual algorithm for semi-infinite programming, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
Uses Software
Cites Work
- The semismooth approach for semi-infinite programming under the reduction ansatz
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Optimal value function in semi-infinite programming
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A QP-free constrained Newton-type method for variational inequality problems
- Interior-point algorithms for semi-infinite programming
- Semismooth Newton methods for solving semi-infinite programming problems
- Differentiability and semismoothness properties of integral functions and their applications
- A smoothing Newton method for semi-infinite programming
- A new computational algorithm for functional inequality constrained optimization problems
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Nonsmooth Equations: Motivation and Algorithms
- Semi-Infinite Programming: Theory, Methods, and Applications
- Computing a Trust Region Step
- An iterative method for solving KKT system of the semi-infinite programming
- A projected lagrangian algorithm for semi-infinite programming
- Optimization and nonsmooth analysis
- An inexact approach to solving linear semi-infinite programming problems
- On Linear Semi-Infinite Programming Problems: An Algorithm
- A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- A dual parametrization method for convex semi-infinite programming
- Computational discretization algorithms for functional inequality constrained optimization
- Second-order optimality conditions in generalized semi-infinite programming
- Semi-infinite programming. Recent advances
- Discretization in semi-infinite programming: the rate of convergence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
