scientific article; zbMATH DE number 1292040
From MaRDI portal
Publication:4241608
zbMATH Open0951.90037MaRDI QIDQ4241608FDOQ4241608
Authors: A. Iwasaki, Hirokazu Ohtagaki, Yuji Nakagawa, Yoshinobu Teraoka, Hiroyuki Narihisa 
Publication date: 26 May 1999
Title of this publication is not available (Why is that?)
Recommendations
- An Algorithm for Separable Nonconvex Programming Problems
- scientific article; zbMATH DE number 503081
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- Approximation to nonproper problems of convex programming
- Approximate customized proximal point algorithms for separable convex optimization
- A proximal multiplier method for separable convex minimization
- A partial inexact proximal point method for separable convex programming
- Solving highly nonlinear convex separable programs using successive approximation
- Approximation methods for problems of nonlinear programming
- A global optimization method for nonconvex separable programming problems
Cited In (12)
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- Equivalence of \(\varepsilon\)-approximate separation and optimization in fixed dimensions.
- A heuristical solution method to separable nonlinear programming problems
- Approximate level method for nonsmooth convex minimization
- A global optimization method for nonconvex separable programming problems
- Title not available (Why is that?)
- Separable optimization. Theory and methods
- Reduction of nonlinear integer separable programming problems∗
- Solving highly nonlinear convex separable programs using successive approximation
- Approximate separable multichoice optimization over monotone systems
- On nonconvex optimization problems with separated nonconvex variables
- Approximation to nonproper problems of convex programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4241608)
