A Globally Convergent Sequential Linear Programming Algorithm for Mathematical Programs With Linear Complementarity Constraints

Journal of Information and Optimization Sciences

doi 10.1080/02522667.2010.10700008

Full Text

Abstract

Available in

Date

September 1, 2010

Authors

Jean Bosco Etoa Etoa

Publisher

Informa UK Limited

Related search

An Adaptive Sequential Linear Programming Algorithm for Optimal Design Problems With Probabilistic Constraints

English

Interior Methods for Mathematical Programs With Complementarity Constraints

SIAM Journal on Optimization

Theoretical Computer Science

English

A New Globally Convergent Algorithm for Nonlinear Semidefinite Programming

Advances in Applied Mathematics

English

A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading

Journal of Mechanical Design, Transactions Of the ASME

Computer Science Applications

Mechanics of Materials

Computer Graphics

Computer-Aided Design

Mechanical Engineering

English

A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming

SIAM Journal on Optimization

Theoretical Computer Science

English

Parallel Successive Overrelaxation Methods for Symmetric Linear Complementarity Problems and Linear Programs

Journal of Optimization Theory and Applications

Management Science

Applied Mathematics

Operations Research

English

A New Smoothing Method for Mathematical Programs With Complementarity Constraints Based on Logarithm-Exponential Function

Mathematical Problems in Engineering

English

A Mathematical Model for Solving Integer Linear Programming Problems

African Journal of Mathematics and Computer Science Research

English

A Polynomial Projection-Type Algorithm for Linear Programming

Operations Research Letters

Applied Mathematics

Manufacturing Engineering

Management Science

Operations Research

English