article

Smoothing methods for convex inequalities and linear complementarity problems

Authors:

Chunhui Chen,

O. L. MangasarianAuthors Info & Claims

Mathematical Programming: Series A and B, Volume 71, Issue 1

Pages 51 - 69

https://doi.org/10.1007/BF01592244

Published: 30 November 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Wang KLiu JSun X(2024)Support vector machine in big data: smoothing strategy and adaptive distributed inferenceStatistics and Computing10.1007/s11222-024-10506-534:6Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s11222-024-10506-5
Moosaei HKetabchi SSyed MBazikar F(2023)Augmented Lagrangian Method for Linear Programming Using Smooth ApproximationDynamics of Information Systems10.1007/978-3-031-50320-7_13(186-193)Online publication date: 3-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-50320-7_13
Royset J(2022)Consistent approximations in composite optimizationMathematical Programming: Series A and B10.1007/s10107-022-01909-1201:1-2(339-372)Online publication date: 28-Dec-2022
https://dl.acm.org/doi/10.1007/s10107-022-01909-1
Show More Cited By

Index Terms

Smoothing methods for convex inequalities and linear complementarity problems
1. Mathematics of computing
  1. Mathematical analysis
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Mathematical optimization
      1. Continuous optimization
        Linear programming

Recommendations

Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems

A first order affine scaling method and two $m$th order affine scaling methods for solving monotone linear complementarity problems (LCPs) are presented. All three methods produce iterates in a wide neighborhood of the central path. The first order ...
Jacobian Smoothing Methods for Nonlinear Complementarity Problems

We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementarity problem as a nonsmooth system of equations by using the Fischer--Burmeister ...
Corrector-predictor methods for sufficient linear complementarity problems

We present a new corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available. In contrast with its predictor-corrector counterpart proposed by Miao, the method ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Mathematical Programming: Series A and B

Mathematical Programming: Series A and B Volume 71, Issue 1

Nov. 30, 1995

110 pages

ISSN:0025-5610

Editor:
A. D. Goldfarb
Columbia Univ., New York, NY

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 30 November 1995

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

56
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang KLiu JSun X(2024)Support vector machine in big data: smoothing strategy and adaptive distributed inferenceStatistics and Computing10.1007/s11222-024-10506-534:6Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s11222-024-10506-5
Moosaei HKetabchi SSyed MBazikar F(2023)Augmented Lagrangian Method for Linear Programming Using Smooth ApproximationDynamics of Information Systems10.1007/978-3-031-50320-7_13(186-193)Online publication date: 3-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-50320-7_13
Royset J(2022)Consistent approximations in composite optimizationMathematical Programming: Series A and B10.1007/s10107-022-01909-1201:1-2(339-372)Online publication date: 28-Dec-2022
https://dl.acm.org/doi/10.1007/s10107-022-01909-1
Chen PLin GZhu XBai F(2021)Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power marketsJournal of Global Optimization10.1007/s10898-021-00993-580:3(635-659)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s10898-021-00993-5
Zhan YLi PDang C(2020)A differentiable path-following algorithm for computing perfect stationary pointsComputational Optimization and Applications10.1007/s10589-020-00181-376:2(571-588)Online publication date: 1-Jun-2020
https://dl.acm.org/doi/10.1007/s10589-020-00181-3
Sun CFeng ZHu G(2019)Distributed Time-Varying Formation and Optimization with Inequality Constraints of a Multi-Robot System2019 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)10.1109/AIM.2019.8868686(629-634)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1109/AIM.2019.8868686
Zhou ZPeng Y(2019)The locally Chen---Harker---Kanzow---Smale smoothing functions for mixed complementarity problemsJournal of Global Optimization10.1007/s10898-019-00739-474:1(169-193)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s10898-019-00739-4
Chen PZhang PZhu XLin G(2019)Modified Jacobian smoothing method for nonsmooth complementarity problemsComputational Optimization and Applications10.1007/s10589-019-00136-375:1(207-235)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1007/s10589-019-00136-3
Abdallah LHaddou MMigot T(2019)A sub-additive DC approach to the complementarity problemComputational Optimization and Applications10.1007/s10589-019-00078-w73:2(509-534)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10589-019-00078-w
Liu CBoumal N(2019)Simple Algorithms for Optimization on Riemannian Manifolds with ConstraintsApplied Mathematics and Optimization10.1007/s00245-019-09564-382:3(949-981)Online publication date: 28-Mar-2019
https://dl.acm.org/doi/10.1007/s00245-019-09564-3
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems

Jacobian Smoothing Methods for Nonlinear Complementarity Problems

Corrector-predictor methods for sufficient linear complementarity problems

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations