Suchergebnisse - "Mathematical program with linear complementarity constraints"

Treffer weiter einschränken
  1. 1

    An Implementable Active‐Set Algorithm for Computing a B‐Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum: An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints

    Autoren: Masao Fukushima Paul Tseng

    Quelle: SIAM Journal on Optimization. 17:1253-1257

    Schlagwörter: numerical examples, Numerical mathematical programming methods, Nonlinear programming, active-set algorithm, 0211 other engineering and technologies, quadratic programming, B-stationary point, 02 engineering and technology, Quadratic programming, MPEC, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), linear inequality/complementarity constraints

    Dateibeschreibung: application/xml

    Zugangs-URL: https://epubs.siam.org/doi/pdf/10.1137/050642460
    http://www-optima.amp.i.kyoto-u.ac.jp/~fuku/papers/mpec_erratum_2.pdf
    https://zbmath.org/1732324
    https://doi.org/10.1137/s1052623499363232

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    On solving difference of convex functions programs with linear complementarity constraints

    Autoren: Le Thi, Hoai An Nguyen, Thi Minh Tam Dinh, Tao Pham et al.

    Weitere Verfasser: Le Thi, Hoai An Nguyen, Thi Minh Tam Dinh, Tao Pham et al.

    Quelle: Computational Optimization and Applications. 86:163-197

    Schlagwörter: Difference of convex functions constraints, Difference of convex functions algorithm, 90C30, [INFO]Computer Science [cs], Difference of convex functions programming, Mathematical program with linear complementarity constraints, [MATH] Mathematics [math], 90C33, [MATH]Mathematics [math], [INFO] Computer Science [cs], Penalty function, 90C90 (Mathematics Subject Classification), 90C26

    Zugangs-URL: https://hal.univ-lorraine.fr/hal-04151433v1
    https://doi.org/10.1007/s10589-023-00487-y

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    An Implementable Active-Set Algorithm for Computing a B-Stationary Point of the Mathematical Program with Linear Complementarity Constraints

    Autoren: Masao Fukushima Paul Tseng The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Masao Fukushima Paul Tseng The Pennsylvania State University CiteSeerX Archives

    Quelle: ftp://ftp.math.washington.edu/pub/tseng/papers/mpec.ps.Z

    Dateibeschreibung: application/postscript

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4988

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4988

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    An implementable active-set algorithm for computing a Bstationary point of a mathematical program with linear complementarity constraints

    Autoren: Masao Fukushima Paul Tseng The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Masao Fukushima Paul Tseng The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www-optima.amp.i.kyoto-u.ac.jp/~fuku/papers/mpec_erratum_2.pdf.

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.2664

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.2664
    http://www-optima.amp.i.kyoto-u.ac.jp/~fuku/papers/mpec_erratum_2.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    AN IMPLEMENTABLE ACTIVE-SET ALGORITHM FOR COMPUTING A B-STATIONARY POINT OF A MATHEMATICAL PROGRAM WITH LINEAR COMPLEMENTARITY CONSTRAINTS: ERRATUM.

    Autoren: Fukushima, Maso Tseng, Paul

    Quelle: SIAM Journal on Optimization; 2006, Vol. 17 Issue 4, p1253-1257, 5p

    Schlagwörter: ALGORITHMS, MATHEMATICAL programming, LINEAR complementarity problem, ERROR, ALGEBRA

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    AN IMPLEMENTABLE ACTIVE-SET ALGORITHM FOR COMPUTINGA B-STATIONARY POINT OF A MATHEMATICAL PROGRAM WITH LINEAR COMPLEMENTARITY CONSTRAINTS*.

    Autoren: Fukushima, Masao Tseng, Paul

    Quelle: SIAM Journal on Optimization; 2002, Vol. 12 Issue 3, p724, 16p

    Schlagwörter: MATHEMATICAL programming, LINEAR complementarity problem

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

    PROJECTED GRADIENT DESCENT ACCUMULATES AT BOULIGAND STATIONARY POINTS.

    Autoren: OLIKIER, GUILLAUME WALDSPURGER, IRÈNE

    Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 2, p1004-1029, 26p

    Schlagwörter: MATHEMATICAL optimization, CONSTRAINED optimization, CRITICAL point theory, LIPSCHITZ continuity, VECTOR spaces, FIXED point theory

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  8. 8

    A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints.

    Autoren: Xinwei Liu Perakis, Georgia Jie Sun

    Quelle: Computational Optimization & Applications; May2006, Vol. 34 Issue 1, p5-33, 29p, 5 Charts

    Schlagwörter: MATHEMATICAL programming, LINEAR complementarity problem, LINEAR programming, QUADRATIC programming, STOCHASTIC convergence, LINEAR dependence (Mathematics), NONLINEAR programming, SEQUENTIAL analysis, MATHEMATICS

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  9. 9

    A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints.

    Autoren: Fukushima, Masao Luo, Zhi-Quan Pang, Jong-Shi

    Quelle: Computational Optimization & Applications; Apr1998, Vol. 10 Issue 1, p5-34, 30p

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  10. 10

    Mathematical program with equilibrium constraints approach with genetic algorithm for joint optimization of charging station location and discrete transport network design.

    Autoren: Qiao, Dong Wang, Guangmin Xu, Meng

    Quelle: Transportation Letters; Sep2024, Vol. 16 Issue 7, p776-792, 17p

    Schlagwörter: ELECTRIC vehicle charging stations, GENETIC algorithms, TRAVEL costs, ELECTRIC vehicles, GASOLINE

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  11. 11

    DATA-DRIVEN DISTRIBUTIONALLY ROBUST MULTIPRODUCT PRICING PROBLEMS UNDER PURE CHARACTERISTICS DEMAND MODELS.

    Autoren: JIE JIANG HAILIN SUN XIAOJUN CHEN

    Quelle: SIAM Journal on Optimization; 2024, Vol. 34 Issue 3, p2917-2942, 26p

    Schlagwörter: DISTRIBUTION (Probability theory), ROBUST optimization, STOCHASTIC models, PRICES, CONSUMERS, COMPLEMENTARITY constraints (Mathematics)

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  12. 12

    A New Extreme Point Algorithm and Its Application in PSQP Algorithms for Solving Mathematical Programs with Linear Complementarity Constraints.

    Autoren: Zhang, Jianzhong Liu, Guoshan

    Quelle: Journal of Global Optimization; Apr2001, Vol. 19 Issue 4, p345-361, 17p

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  13. 13

    Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method.

    Autoren: Li, Qingna Li, Zhen Zemkoho, Alain

    Quelle: Mathematical Methods of Operations Research; Dec2022, Vol. 96 Issue 3, p315-350, 36p

    Schlagwörter: BILEVEL programming, REGULARIZATION parameter, CLASSIFICATION

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  14. 14

    SEQUENTIAL LINEARIZATION METHOD FOR BOUND-CONSTRAINED MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS.

    Autoren: KIRCHES, CHRISTIAN LARSON, JEFFREY LEYFFER, SVEN et al.

    Quelle: SIAM Journal on Optimization; 2022, Vol. 32 Issue 1, p75-99, 25p

    Schlagwörter: LINEAR complementarity problem, NUMERICAL analysis, CONSTRAINED optimization, LINEAR programming

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  15. 15

    New characterizations of Hoffman constants for systems of linear constraints.

    Autoren: Peña, Javier Vera, Juan C. Zuluaga, Luis F.

    Quelle: Mathematical Programming; May2021, Vol. 187 Issue 1/2, p79-109, 31p

    Schlagwörter: LINEAR systems

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  16. 16

    REFORMULATION OF THE M-STATIONARITY CONDITIONS AS A SYSTEM OF DISCONTINUOUS EQUATIONS AND ITS SOLUTION BY A SEMISMOOTH NEWTON METHOD.

    Autoren: HARDER, FELIX MEHLITZ, PATRICK WACHSMUTH, GERD

    Quelle: SIAM Journal on Optimization; 2021, Vol. 31 Issue 2, p1459-1488, 30p

    Schlagwörter: ALGORITHMS, NEWTON-Raphson method, EQUATIONS, NONLINEAR functions

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  17. 17

    Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation.

    Autoren: Guo, Lei Chen, Xiaojun

    Quelle: Mathematical Programming; 2021, Vol. 185 Issue 1/2, p455-485, 31p

    Schlagwörter: COMPLEMENTARITY constraints (Mathematics), LINEAR complementarity problem

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  18. 18

    A New MIP Approach on the Least Distance Problem in DEA.

    Autoren: Wang, Xu Lu, Kuan Shi, Jianming et al.

    Quelle: Asia-Pacific Journal of Operational Research; Dec2020, Vol. 37 Issue 6, pN.PAG-N.PAG, 18p

    Schlagwörter: GROUP decision making, DATA envelopment analysis, INTEGER programming, DISTANCES, LINEAR systems

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  19. 19

    A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem.

    Autoren: Lu, Kuan Mizuno, Shinji Shi, Jianming

    Quelle: Optimization Letters; Nov2020, Vol. 14 Issue 8, p2323-2333, 11p

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  20. 20

    A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem.

    Autoren: Zeng, Bo

    Quelle: INFORMS Journal on Computing; Fall2020, Vol. 32 Issue 4, p1128-1142, 15p

    Schlagwörter: BILEVEL programming

    Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: