• 沒有找到結果。

C.GROSSMANN 69 CONTENTS

N/A
N/A
Protected

Academic year: 2022

Share "C.GROSSMANN 69 CONTENTS"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

OPTIMIZATION Volume 45(1-4) (1999)

CONTENTS

Editorial v Foreword vii Lower Subdifferentiability in Minimax

Fractional Programming

C. BAJONA-XANDRI AND J . E. MARTINEZ-LEGAZ 1 Exhausters of a Positively Homogeneous Function

V. F. DEMYANOV 13

On Subclasses of the Caratheodory Class with Matricial Extremal Property

B. FRITZSCHE, S. FUCHS AND B. KIRSTEIN 31

Existence and Proximal Point Algorithms

for Nonlinear Monotone Complementarity Problems

A. GOPFERT, CHR. TAMMER AND H. RIAHI 57 ,

Asymptotic Analysis of a Path-Following Barrier Method for Linearly Constrained Convex Problems

C.GROSSMANN 69

A Relaxed Cutting Plane Algorithm for Solving Fuzzy Inequality Systems

C.-F. HU AND S.-C. FANG 89

Biobjective Center-Balance Graph Location Model

0. HUDEC AND K. ZIMMERMANN 107

Proximal Interior Point Approach in Convex Programming (Ill-Posed Problems)

A. KAPLAN AND R. TICHA TSCHKE 117

參考文獻

相關文件

We denote V (T ) the set of all common zeros of polynomials in T, i.e.. We completes

[r]

The masses (amu) and % abundances of the isotopes are given in the table below.. 32) A certain mass of carbon reacts with 23.3 g of oxygen to form

[r]

In particular, when the cone reduces to three specific cones, that is, the p-order cone, L p cone and circular cone, we show that the obtained results can be achieved by easier ways

Numerical experiments are done for a class of quasi-convex optimization problems where the function f (x) is a composition of a quadratic convex function from IR n to IR and

A barrier-based smoothing proximal point algorithm for nonlinear complementarity problems over closed convex cones.

Ellipsoidal Approach to Box-Constrained Quadratic Problems 1-15 Lian-Sheng Zhang, Chi-Kong Ng, Duan Li and Wei-Wen Tian / A New.. Filled Function Method for Global Optimization