Smoothing methods for convex inequalities and linear complementarity problems

DOI10.1007/BF01592244zbMath0855.90124MaRDI QIDQ1924058

Chunhui Chen, Olvi L. Mangasarian

Publication date: 3 February 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear complementaritysmoothingneural networksconvex inequalitiessmooth, convex unconstrained minimization

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

An entropic regularization approach for mathematical programs with equilibrium constraints, Non-interior smoothing algorithm for frictional contact problems, Primal-dual nonlinear rescaling method for convex optimization, Analysis of a smoothing method for symmetric conic linear programming, Myopic robust index tracking with Bregman divergence, Smoothed penalty algorithms for optimization of nonlinear models, How to deal with the unbounded in optimization: Theory and algorithms, On the smoothing of the square-root exact penalty function for inequality constrained optimization, Finite-strain low order shell using least-squares strains and two-parameter thickness extensibility, Asymmetric quadrilateral shell elements for finite strains, A second-order smooth penalty function algorithm for constrained optimization problems, Finite strain plasticity, the stress condition and a complete shell model, Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, Feasible method for generalized semi-infinite programming, A class of smoothing methods for mathematical programs with complementarity constraints, On almost smooth functions and piecewise smooth functions, Solving frictional contact problems by two aggregate-function-based algorithms, Initially rigid cohesive laws and fracture based on edge rotations, A differentiable path-following algorithm for computing perfect stationary points, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework, MPCC strategies for nonsmooth nonlinear programs, Finite strain fracture of plates and shells with configurational forces and edge rotations, A sub-additive DC approach to the complementarity problem, A Self-Concordant Interior Point Approach for Optimal Control with State Constraints, Global convergence of a class new smooth penalty algorithm for constrained optimization problem, Global convergence of a class of smooth penalty methods for semi-infinite programming, On the convergence of a smooth penalty algorithm without computing global solutions, Constrained motion planning of nonholonomic systems, The locally Chen-Harker-Kanzow-Smale smoothing functions for mixed complementarity problems, The Legendre Transformation in Modern Optimization, Hierarchical Nash equilibrium seeking strategies of quadratic time‐varying games with Euler–Lagrange players, Consistent approximations in composite optimization, A new semi-implicit formulation for multiple-surface flow rules in multiplicative plasticity, Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity., Fast Calibrated Additive Quantile Regression, Unnamed Item, A class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints, A study of regularization techniques of nondifferentiable optimization in view of application to hemivariational inequalities, A kind of stochastic eigenvalue complementarity problems, Smoothing method for mathematical programs with symmetric cone complementarity constraints, Smooth finite strain plasticity with non-local pressure support, On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems, Nonsmooth model for plastic limit analysis and its smoothing algorithm, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, An Adaptive Penalty Method for Inequality Constrained Minimization Problems, Extension of smoothing functions to symmetric cone complementarity problems, Taylor Approximation for Chance Constrained Optimization Problems Governed by Partial Differential Equations with High-Dimensional Random Parameters, Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems, Differential variational inequalities, Homotopy method for solving variational inequalities with bounded box constraints, On the global minimization of the value-at-risk, A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties, Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity., Verification for existence of solutions of linear complementarity problems, Global convergence and finite termination of a class of smooth penalty function algorithms, A matrix-splitting method for symmetric affine second-order cone complementarity problems, Recursive approximation of the high dimensional max function, A penalty function method based on smoothing lower order penalty function, Risk-Averse PDE-Constrained Optimization Using the Conditional Value-At-Risk, Predictor-corrector smoothing methods for monotone LCP, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, Penalty functions with a small penalty parameter, Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem, Simple algorithms for optimization on Riemannian manifolds with constraints, Examples of ill-behaved central paths in convex optimization, Smoothing methods for nonsmooth, nonconvex minimization, Smoothing method for minimizing the sum of therlargest functions, A primal-dual algorithm for minimizing a sum of Euclidean norms, An alternative formulation for quasi-static frictional and cohesive contact problems, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, Improving the convergence of non-interior point algorithms for nonlinear complementarity problems, A smoothing homotopy method for solving variational inequalities, Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets, Value-estimation function method for constrained global optimization, Modified Jacobian smoothing method for nonsmooth complementarity problems, Regularity and Stability of Feedback Relaxed Controls, Collective Stability of Networks of Winner-Take-All Circuits, A class of smoothing functions for nonlinear and mixed complementarity problems, A finite-strain solid-shell using local Löwdin frames and least-squares strains, Unnamed Item, On smoothing exact penalty functions for nonlinear constrained optimization problems, Regularized smoothing approximations to vertical nonlinear complementarity problems, A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function, A smoothing Newton method with a mixed line search for monotone weighted complementarity problems, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Newton's method for linear inequality systems, Value estimation approach to the Iri-Imai method for constrained convex optimization, An efficient algorithm for the Euclidean \(r\)-centrum location problem, A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone, Smooth augmented Lagrangian method for twin bounded support vector machine, Solving time-varying nonlinear inequalities using continuous and discrete-time Zhang dynamics, On the equivalence of linear complementarity problems, Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem, Entropic perturbation method for solving a system of linear inequalities

Uses Software

• MINOS
• tn
• PATH Solver
• MCPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for a class of linear complementarity problems
• New improved error bounds for the linear complementarity problem
• Error bounds for inconsistent linear inequalities and programs
• Newton-Type Minimization via the Lanczos Method
• A Condition Number for Differentiable Convex Inequalities
• An Application of Error Bounds for Convex Programming in a Linear Space
• Mathematical Programming in Neural Networks
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• Convex Analysis
• The Relaxation Method for Linear Inequalities