Nonsmooth Equations: Motivation and Algorithms
From MaRDI portal
Publication:3139996
DOI10.1137/0803021zbMATH Open0784.90082OpenAlexW2053643774MaRDI QIDQ3139996FDOQ3139996
Authors: Jong-Shi Pang, Liqun Qi 
Publication date: 21 March 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0803021
Recommendations
global convergencenonsmooth equationsGauss-Newton type algorithmsemismooth mappingssuperlinearly converging quasi-Newton algorithms
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Implicit function theorems, Jacobians, transformations with several variables (26B10) Variational inequalities (49J40)
Cited In (only showing first 100 items - show all)
- A filter-trust-region method for LC 1 unconstrained optimization and its global convergence
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- Neural network models and its application for solving linear and quadratic programming problems
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- A monotone semismooth Newton type method for a class of complementarity problems
- The iterative methods for monotone generalized variational inequalities
- Sensitivity analysis of composite piecewise smooth equations
- The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- Affine scaling inexact generalized Newton algorithm with interior backtracking technique for solving bound-constrained semismooth equations
- Time-stepping for three-dimensional rigid body dynamics
- Generalized Nash equilibrium problems
- New version of the Newton method for nonsmooth equations
- A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Calibration of estimator-weights via semismooth Newton method
- A proximal point algorithm for the monotone second-order cone complementarity problem
- Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems.
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- Self-adaptive implicit methods for monotone variant variational inequalities
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach
- Neural networks for a class of bi-level variational inequalities
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
- A family of variable metric proximal methods
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- A class of iterative methods for solving nonlinear projection equations
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A new smoothing Newton-type algorithm for semi-infinite programming
- Inexact-Newton methods for semismooth systems of equations with block-angular structure
- On preconditioned Uzawa methods and SOR methods for saddle-point problems
- A smoothing projected Newton-type algorithm for semi-infinite programming
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
- A smoothing Newton method for solving a class of stochastic linear complementarity problems
- Algebraic univalence theorems for nonsmooth functions
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- A family of Newton methods for nonsmooth constrained systems with nonisolated solutions
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Inexact Newton methods for solving nonsmooth equations
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- A new trust region method for nonsmooth equations
- A smoothing Newton method for semi-infinite programming
- An approximate Newton method for non-smooth equations with finite max functions
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- Optimization of a nonlinear area traffic control system with elastic demand
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Historical developments in convergence analysis for Newton's and Newton-like methods
- The theory of Newton's method
- On a Steffensen's type method and its behavior for semismooth equations
- A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Clarke generalized Jacobian of the projection onto symmetric cones
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Constrained optimal control of Navier--Stokes flow by semismooth Newton methods
- Affine scaling interior Levenberg-Marquardt method for bound-constrained semismooth equations under local error bound conditions
- A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems
- On a semismooth least squares formulation of complementarity problems with gap reduction
- An NE/SQP method for the bounded nonlinear complementarity problem
- The relaxed nonlinear PHSS-like iteration method for absolute value equations
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming
- Title not available (Why is that?)
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- A verification method for solutions of nonsmooth equations
- Generalized Newton's method based on graphical derivatives
- Inverse variational inequalities with projection-based solution methods
- Title not available (Why is that?)
- Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction
- Convergence analysis of a proximal newton method1
- Generalized Nash equilibrium problems
- Parametric method for global optimization
- Convergence rate of Newton's method for \(L_2\) spectral estimation
- Variationally consistent discretization schemes and numerical algorithms for contact problems
- A parametrized Newton method for nonsmooth equations with finitely many maximum functions
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques
- A further result on an implicit function theorem for locally Lipschitz functions
- Global projection-type error bounds for general variational inequalities
- Parametric proximal-point methods
- Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations
- Scalable semismooth Newton methods with multilevel domain decomposition for subsurface flow and reactive transport in porous media
- Numerical comparisons of two effective methods for mixed complementarity problems
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
- A Parametric Newton Method for Optimization Problems in Hilbert Spaces
- A Jacobian smoothing inexact Newton method for solving the nonlinear complementary problem
This page was built for publication: Nonsmooth Equations: Motivation and Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139996)
