| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2018-12-12 10:50 Minimization of an M-convex Function under L1-distance Constraint Akiyoshi Shioura (Tokyo Inst. Tech.)  COMP2018-33 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the constraint is given by an upper bound for L1-distance between a feasible solution and a given “center.” We present a pseudo-polynomial-time algorithm for (MML1) based on steepest descent approach. We also propose two polynomial-time algorithms for (MML1) by replacing the L1-distance constraint with a simple linear constraint. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | discrete convex analysis / discrete convex function / nonlinear integer programming problem / polynomial-time algorithm / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 118, no. 356, COMP2018-33, pp. 15-20, Dec. 2018. | |
| Paper # | COMP2018-33 | |
| Date of Issue | 2018-12-05 (COMP) | |
| ISSN | Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | COMP2018-33 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2018-12-12 - 2018-12-12 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Tohoku University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2018-12-COMP |
| Language | English |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Minimization of an M-convex Function under L1-distance Constraint |
| Sub Title (in English) | |
| Keyword(1) | discrete convex analysis |
| Keyword(2) | discrete convex function |
| Keyword(3) | nonlinear integer programming problem |
| Keyword(4) | polynomial-time algorithm |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Akiyoshi Shioura |
| 1st Author's Affiliation | Tokyo Institute of Technology (Tokyo Inst. Tech.) |
| 2nd Author's Name | |
| 2nd Author's Affiliation | () |
| 3rd Author's Name | |
| 3rd Author's Affiliation | () |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2018-12-12 10:50:00 |
| Presentation Time | 25 minutes |
| Registration for | COMP |
| Paper # | COMP2018-33 |
| Volume (vol) | vol.118 |
| Number (no) | no.356 |
| Page | pp.15-20 |
| #Pages | 6 |
| Date of Issue | 2018-12-05 (COMP) |
[Return to Top Page]